1 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
4 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
5 <title>Class template circular_buffer_space_optimized</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="../boost_circular_buffer_c___reference.html#header.boost.circular_buffer.space_optimized_hpp" title="Header <boost/circular_buffer/space_optimized.hpp>">
10 <link rel="prev" href="swap_idm45097335994640.html" title="Function template swap">
11 <link rel="next" href="../circular_buffer/s14.html" title="Index">
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>
23 <div class="spirit-nav">
24 <a accesskey="p" href="swap_idm45097335994640.html"><img src="../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../boost_circular_buffer_c___reference.html#header.boost.circular_buffer.space_optimized_hpp"><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="../circular_buffer/s14.html"><img src="../../../doc/src/images/next.png" alt="Next"></a>
26 <div class="refentry">
27 <a name="boost.circular_idm45097335975600"></a><div class="titlepage"></div>
28 <div class="refnamediv">
29 <h2><span class="refentrytitle">Class template circular_buffer_space_optimized</span></h2>
30 <p>boost::circular_buffer_space_optimized — Space optimized circular buffer container adaptor. <code class="computeroutput">T</code> must be a copyable class or must have an noexcept move constructor and move assignment operator. </p>
32 <h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
33 <div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../boost_circular_buffer_c___reference.html#header.boost.circular_buffer.space_optimized_hpp" title="Header <boost/circular_buffer/space_optimized.hpp>">boost/circular_buffer/space_optimized.hpp</a>>
35 </span><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="keyword">typename</span> Alloc<span class="special">></span>
36 <span class="keyword">class</span> <a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a> <span class="special">:</span>
37 <span class="keyword">private</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">Alloc</span> <span class="special">></span>
38 <span class="special">{</span>
39 <span class="keyword">public</span><span class="special">:</span>
40 <span class="comment">// <a class="link" href="circular_idm45097335975600.html#boost.circular_idm45097335975600types">types</a></span>
41 <span class="keyword">typedef</span> <a class="link" href="circular_buffer.html" title="Class template circular_buffer">circular_buffer</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span> <a name="boost.circular_idm45097335975600.value_type"></a><span class="identifier">value_type</span><span class="special">;</span>
42 <span class="keyword">typedef</span> <a class="link" href="circular_buffer.html" title="Class template circular_buffer">circular_buffer</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span><span class="special">::</span><span class="identifier">pointer</span> <a name="boost.circular_idm45097335975600.pointer"></a><span class="identifier">pointer</span><span class="special">;</span>
43 <span class="keyword">typedef</span> <a class="link" href="circular_buffer.html" title="Class template circular_buffer">circular_buffer</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span><span class="special">::</span><span class="identifier">const_pointer</span> <a name="boost.circular_idm45097335975600.const_pointer"></a><span class="identifier">const_pointer</span><span class="special">;</span>
44 <span class="keyword">typedef</span> <a class="link" href="circular_buffer.html" title="Class template circular_buffer">circular_buffer</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span><span class="special">::</span><span class="identifier">reference</span> <a name="boost.circular_idm45097335975600.reference"></a><span class="identifier">reference</span><span class="special">;</span>
45 <span class="keyword">typedef</span> <a class="link" href="circular_buffer.html" title="Class template circular_buffer">circular_buffer</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span><span class="special">::</span><span class="identifier">const_reference</span> <a name="boost.circular_idm45097335975600.const_reference"></a><span class="identifier">const_reference</span><span class="special">;</span>
46 <span class="keyword">typedef</span> <a class="link" href="circular_buffer.html" title="Class template circular_buffer">circular_buffer</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span><span class="special">::</span><span class="identifier">size_type</span> <a name="boost.circular_idm45097335975600.size_type"></a><span class="identifier">size_type</span><span class="special">;</span>
47 <span class="keyword">typedef</span> <a class="link" href="circular_buffer.html" title="Class template circular_buffer">circular_buffer</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span><span class="special">::</span><span class="identifier">difference_type</span> <a name="boost.circular_idm45097335975600.difference_type"></a><span class="identifier">difference_type</span><span class="special">;</span>
48 <span class="keyword">typedef</span> <a class="link" href="circular_buffer.html" title="Class template circular_buffer">circular_buffer</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span><span class="special">::</span><span class="identifier">allocator_type</span> <a name="boost.circular_idm45097335975600.allocator_type"></a><span class="identifier">allocator_type</span><span class="special">;</span>
49 <span class="keyword">typedef</span> <a class="link" href="circular_buffer.html" title="Class template circular_buffer">circular_buffer</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span><span class="special">::</span><span class="identifier">const_iterator</span> <a name="boost.circular_idm45097335975600.const_iterator"></a><span class="identifier">const_iterator</span><span class="special">;</span>
50 <span class="keyword">typedef</span> <a class="link" href="circular_buffer.html" title="Class template circular_buffer">circular_buffer</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span><span class="special">::</span><span class="identifier">iterator</span> <a name="boost.circular_idm45097335975600.iterator"></a><span class="identifier">iterator</span><span class="special">;</span>
51 <span class="keyword">typedef</span> <a class="link" href="circular_buffer.html" title="Class template circular_buffer">circular_buffer</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span><span class="special">::</span><span class="identifier">const_reverse_iterator</span> <a name="boost.circular_idm45097335975600.const_reverse_iterator"></a><span class="identifier">const_reverse_iterator</span><span class="special">;</span>
52 <span class="keyword">typedef</span> <a class="link" href="circular_buffer.html" title="Class template circular_buffer">circular_buffer</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span><span class="special">::</span><span class="identifier">reverse_iterator</span> <a name="boost.circular_idm45097335975600.reverse_iterator"></a><span class="identifier">reverse_iterator</span><span class="special">;</span>
53 <span class="keyword">typedef</span> <a class="link" href="circular_buffer.html" title="Class template circular_buffer">circular_buffer</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span><span class="special">::</span><span class="identifier">array_range</span> <a name="boost.circular_idm45097335975600.array_range"></a><span class="identifier">array_range</span><span class="special">;</span>
54 <span class="keyword">typedef</span> <a class="link" href="circular_buffer.html" title="Class template circular_buffer">circular_buffer</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span><span class="special">::</span><span class="identifier">const_array_range</span> <a name="boost.circular_idm45097335975600.const_array_range"></a><span class="identifier">const_array_range</span><span class="special">;</span>
55 <span class="keyword">typedef</span> <a class="link" href="circular_buffer.html" title="Class template circular_buffer">circular_buffer</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span><span class="special">::</span><span class="identifier">param_value_type</span> <a name="boost.circular_idm45097335975600.param_value_type"></a><span class="identifier">param_value_type</span><span class="special">;</span>
56 <span class="keyword">typedef</span> <a class="link" href="circular_buffer.html" title="Class template circular_buffer">circular_buffer</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span><span class="special">::</span><span class="identifier">rvalue_type</span> <a name="boost.circular_idm45097335975600.rvalue_type"></a><span class="identifier">rvalue_type</span><span class="special">;</span>
57 <span class="keyword">typedef</span> <span class="identifier">cb_details</span><span class="special">::</span><span class="identifier">capacity_control</span><span class="special"><</span> <span class="identifier">size_type</span> <span class="special">></span> <a class="link" href="circular_idm45097335975600.html#boost.circular_idm45097335975600.capacity_type"><span class="identifier">capacity_type</span></a><span class="special">;</span>
59 <span class="comment">// <a class="link" href="circular_idm45097335975600.html#boost.circular_idm45097335975600construct-copy-destruct">construct/copy/destruct</a></span>
60 <span class="keyword">explicit</span> <a class="link" href="circular_idm45097335975600.html#idm45097335207776-bb"><span class="identifier">circular_buffer_space_optimized</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span> <span class="keyword">noexcept</span><span class="special">;</span>
61 <span class="keyword">explicit</span> <a class="link" href="circular_idm45097335975600.html#idm45097335201280-bb"><span class="identifier">circular_buffer_space_optimized</span></a><span class="special">(</span><span class="identifier">capacity_type</span><span class="special">,</span>
62 <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
63 <a class="link" href="circular_idm45097335975600.html#idm45097335192416-bb"><span class="identifier">circular_buffer_space_optimized</span></a><span class="special">(</span><span class="identifier">capacity_type</span><span class="special">,</span> <span class="identifier">param_value_type</span><span class="special">,</span>
64 <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
65 <a class="link" href="circular_idm45097335975600.html#idm45097335179904-bb"><span class="identifier">circular_buffer_space_optimized</span></a><span class="special">(</span><span class="identifier">capacity_type</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">param_value_type</span><span class="special">,</span>
66 <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
67 <a class="link" href="circular_idm45097335975600.html#idm45097335164560-bb"><span class="identifier">circular_buffer_space_optimized</span></a><span class="special">(</span><span class="keyword">const</span> <a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
68 <a class="link" href="circular_idm45097335975600.html#idm45097335155328-bb"><span class="identifier">circular_buffer_space_optimized</span></a><span class="special">(</span><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span> <span class="special">&&</span><span class="special">)</span> <span class="keyword">noexcept</span><span class="special">;</span>
69 <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">></span>
70 <a class="link" href="circular_idm45097335975600.html#idm45097335147136-bb"><span class="identifier">circular_buffer_space_optimized</span></a><span class="special">(</span><span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">,</span>
71 <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
72 <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">></span>
73 <a class="link" href="circular_idm45097335975600.html#idm45097335132592-bb"><span class="identifier">circular_buffer_space_optimized</span></a><span class="special">(</span><span class="identifier">capacity_type</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">,</span>
74 <span class="identifier">InputIterator</span><span class="special">,</span>
75 <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
76 <a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span> <span class="special">&</span>
77 <a class="link" href="circular_idm45097335975600.html#idm45097335112944-bb"><span class="keyword">operator</span><span class="special">=</span></a><span class="special">(</span><span class="keyword">const</span> <a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
78 <a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span> <span class="special">&</span>
79 <a class="link" href="circular_idm45097335975600.html#idm45097335095808-bb"><span class="keyword">operator</span><span class="special">=</span></a><span class="special">(</span><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span> <span class="special">&&</span><span class="special">)</span> <span class="keyword">noexcept</span><span class="special">;</span>
81 <span class="comment">// <a class="link" href="circular_idm45097335975600.html#idm45097335939008-bb">public member functions</a></span>
82 <span class="keyword">bool</span> <a class="link" href="circular_idm45097335975600.html#idm45097335938448-bb"><span class="identifier">full</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span> <span class="keyword">noexcept</span><span class="special">;</span>
83 <span class="identifier">size_type</span> <a class="link" href="circular_idm45097335975600.html#idm45097335926352-bb"><span class="identifier">reserve</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span> <span class="keyword">noexcept</span><span class="special">;</span>
84 <span class="keyword">const</span> <span class="identifier">capacity_type</span> <span class="special">&</span> <a class="link" href="circular_idm45097335975600.html#idm45097335915520-bb"><span class="identifier">capacity</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span> <span class="keyword">noexcept</span><span class="special">;</span>
85 <span class="keyword">void</span> <a class="link" href="circular_idm45097335975600.html#idm45097335903584-bb"><span class="identifier">set_capacity</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">capacity_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
86 <span class="keyword">void</span> <a class="link" href="circular_idm45097335975600.html#idm45097335880432-bb"><span class="identifier">resize</span></a><span class="special">(</span><span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">param_value_type</span> <span class="special">=</span> <span class="identifier">value_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
87 <span class="keyword">void</span> <a class="link" href="circular_idm45097335975600.html#idm45097335857696-bb"><span class="identifier">rset_capacity</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">capacity_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
88 <span class="keyword">void</span> <a class="link" href="circular_idm45097335975600.html#idm45097335838944-bb"><span class="identifier">rresize</span></a><span class="special">(</span><span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">param_value_type</span> <span class="special">=</span> <span class="identifier">value_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
89 <span class="keyword">void</span> <a class="link" href="circular_idm45097335975600.html#idm45097335816208-bb"><span class="identifier">assign</span></a><span class="special">(</span><span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">param_value_type</span><span class="special">)</span><span class="special">;</span>
90 <span class="keyword">void</span> <a class="link" href="circular_idm45097335975600.html#idm45097335796928-bb"><span class="identifier">assign</span></a><span class="special">(</span><span class="identifier">capacity_type</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">param_value_type</span><span class="special">)</span><span class="special">;</span>
91 <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">></span> <span class="keyword">void</span> <a class="link" href="circular_idm45097335975600.html#idm45097335774736-bb"><span class="identifier">assign</span></a><span class="special">(</span><span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">)</span><span class="special">;</span>
92 <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">></span>
93 <span class="keyword">void</span> <a class="link" href="circular_idm45097335975600.html#idm45097335753632-bb"><span class="identifier">assign</span></a><span class="special">(</span><span class="identifier">capacity_type</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">)</span><span class="special">;</span>
94 <span class="keyword">void</span> <a class="link" href="circular_idm45097335975600.html#idm45097335726800-bb"><span class="identifier">swap</span></a><span class="special">(</span><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span> <span class="special">&</span><span class="special">)</span> <span class="keyword">noexcept</span><span class="special">;</span>
95 <span class="keyword">void</span> <a class="link" href="circular_idm45097335975600.html#idm45097335712304-bb"><span class="identifier">push_back</span></a><span class="special">(</span><span class="identifier">param_value_type</span><span class="special">)</span><span class="special">;</span>
96 <span class="keyword">void</span> <a class="link" href="circular_idm45097335975600.html#idm45097335696432-bb"><span class="identifier">push_back</span></a><span class="special">(</span><span class="identifier">rvalue_type</span><span class="special">)</span><span class="special">;</span>
97 <span class="keyword">void</span> <a class="link" href="circular_idm45097335975600.html#idm45097335681024-bb"><span class="identifier">push_back</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span>
98 <span class="keyword">void</span> <a class="link" href="circular_idm45097335975600.html#idm45097335665376-bb"><span class="identifier">push_front</span></a><span class="special">(</span><span class="identifier">param_value_type</span><span class="special">)</span><span class="special">;</span>
99 <span class="keyword">void</span> <a class="link" href="circular_idm45097335975600.html#idm45097335649504-bb"><span class="identifier">push_front</span></a><span class="special">(</span><span class="identifier">rvalue_type</span><span class="special">)</span><span class="special">;</span>
100 <span class="keyword">void</span> <a class="link" href="circular_idm45097335975600.html#idm45097335633184-bb"><span class="identifier">push_front</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span>
101 <span class="keyword">void</span> <a class="link" href="circular_idm45097335975600.html#idm45097335617536-bb"><span class="identifier">pop_back</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span>
102 <span class="keyword">void</span> <a class="link" href="circular_idm45097335975600.html#idm45097335603920-bb"><span class="identifier">pop_front</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span>
103 <span class="identifier">iterator</span> <a class="link" href="circular_idm45097335975600.html#idm45097335590304-bb"><span class="identifier">insert</span></a><span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">param_value_type</span><span class="special">)</span><span class="special">;</span>
104 <span class="identifier">iterator</span> <a class="link" href="circular_idm45097335975600.html#idm45097335565280-bb"><span class="identifier">insert</span></a><span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">rvalue_type</span><span class="special">)</span><span class="special">;</span>
105 <span class="identifier">iterator</span> <a class="link" href="circular_idm45097335975600.html#idm45097335540272-bb"><span class="identifier">insert</span></a><span class="special">(</span><span class="identifier">iterator</span><span class="special">)</span><span class="special">;</span>
106 <span class="keyword">void</span> <a class="link" href="circular_idm45097335975600.html#idm45097335515936-bb"><span class="identifier">insert</span></a><span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">param_value_type</span><span class="special">)</span><span class="special">;</span>
107 <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">></span>
108 <span class="keyword">void</span> <a class="link" href="circular_idm45097335975600.html#idm45097335483376-bb"><span class="identifier">insert</span></a><span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">)</span><span class="special">;</span>
109 <span class="identifier">iterator</span> <a class="link" href="circular_idm45097335975600.html#idm45097335444752-bb"><span class="identifier">rinsert</span></a><span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">param_value_type</span><span class="special">)</span><span class="special">;</span>
110 <span class="identifier">iterator</span> <a class="link" href="circular_idm45097335975600.html#idm45097335419744-bb"><span class="identifier">rinsert</span></a><span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">rvalue_type</span><span class="special">)</span><span class="special">;</span>
111 <span class="identifier">iterator</span> <a class="link" href="circular_idm45097335975600.html#idm45097335394752-bb"><span class="identifier">rinsert</span></a><span class="special">(</span><span class="identifier">iterator</span><span class="special">)</span><span class="special">;</span>
112 <span class="keyword">void</span> <a class="link" href="circular_idm45097335975600.html#idm45097335370432-bb"><span class="identifier">rinsert</span></a><span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">param_value_type</span><span class="special">)</span><span class="special">;</span>
113 <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">></span>
114 <span class="keyword">void</span> <a class="link" href="circular_idm45097335975600.html#idm45097335337904-bb"><span class="identifier">rinsert</span></a><span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">)</span><span class="special">;</span>
115 <span class="identifier">iterator</span> <a class="link" href="circular_idm45097335975600.html#idm45097335299280-bb"><span class="identifier">erase</span></a><span class="special">(</span><span class="identifier">iterator</span><span class="special">)</span><span class="special">;</span>
116 <span class="identifier">iterator</span> <a class="link" href="circular_idm45097335975600.html#idm45097335281168-bb"><span class="identifier">erase</span></a><span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span><span class="special">)</span><span class="special">;</span>
117 <span class="identifier">iterator</span> <a class="link" href="circular_idm45097335975600.html#idm45097335262272-bb"><span class="identifier">rerase</span></a><span class="special">(</span><span class="identifier">iterator</span><span class="special">)</span><span class="special">;</span>
118 <span class="identifier">iterator</span> <a class="link" href="circular_idm45097335975600.html#idm45097335242032-bb"><span class="identifier">rerase</span></a><span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span><span class="special">)</span><span class="special">;</span>
119 <span class="keyword">void</span> <a class="link" href="circular_idm45097335975600.html#idm45097335220832-bb"><span class="identifier">clear</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span>
120 <span class="special">}</span><span class="special">;</span></pre></div>
121 <div class="refsect1">
122 <a name="id-1.3.9.16.4.3.4"></a><h2>Description</h2>
123 <div class="refsect2">
124 <a name="id-1.3.9.16.4.3.4.2"></a><h3>
125 <a name="boost.circular_idm45097335975600types"></a><code class="computeroutput">circular_buffer_space_optimized</code>
128 <div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
130 <span class="keyword">typedef</span> <span class="identifier">cb_details</span><span class="special">::</span><span class="identifier">capacity_control</span><span class="special"><</span> <span class="identifier">size_type</span> <span class="special">></span> <a name="boost.circular_idm45097335975600.capacity_type"></a><span class="identifier">capacity_type</span><span class="special">;</span></p>
131 <p>Capacity controller of the space optimized circular buffer.</p>
132 <p><span class="bold"><strong>See Also:</strong></span></p>
133 <p>capacity_control in details.hpp. </p>
137 <code class="computeroutput"> class capacity_control<br>
139 size_type m_capacity; // Available capacity.<br>
140 size_type m_min_capacity; // Minimum capacity.<br>
142 capacity_control(size_type capacity, size_type min_capacity = 0)<br>
143 : m_capacity(capacity), m_min_capacity(min_capacity)<br>
145 size_type capacity() const { return m_capacity; }<br>
146 size_type min_capacity() const { return m_min_capacity; }<br>
147 operator size_type() const { return m_capacity; }<br>
150 <p>Always <code class="computeroutput">capacity >= min_capacity</code>. </p>
151 <p>The <code class="computeroutput">capacity()</code> represents the capacity of the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> and the <code class="computeroutput">min_capacity()</code> determines the minimal allocated size of its internal buffer. </p>
152 <p>The converting constructor of the <code class="computeroutput">capacity_control</code> allows implicit conversion from <code class="computeroutput">size_type</code>-like types which ensures compatibility of creating an instance of the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> with other STL containers.</p>
153 <p>On the other hand the operator <code class="computeroutput">size_type()</code> provides implicit conversion to the <code class="computeroutput">size_type</code> which allows to treat the capacity of the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> the same way as in the <code class="computeroutput"><a class="link" href="circular_buffer.html" title="Class template circular_buffer">circular_buffer</a></code>. </p>
156 <div class="refsect2">
157 <a name="id-1.3.9.16.4.3.4.3"></a><h3>
158 <a name="boost.circular_idm45097335975600construct-copy-destruct"></a><code class="computeroutput">circular_buffer_space_optimized</code>
160 construct/copy/destruct</h3>
161 <div class="orderedlist"><ol class="orderedlist" type="1">
162 <li class="listitem">
163 <pre class="literallayout"><span class="keyword">explicit</span> <a name="idm45097335207776-bb"></a><span class="identifier">circular_buffer_space_optimized</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&</span> alloc <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span> <span class="keyword">noexcept</span><span class="special">;</span></pre>Create an empty space optimized circular buffer with zero capacity. <p>
167 <p><b>Complexity. </b>Constant. </p>
170 <div class="warning"><table border="0" summary="Warning">
172 <td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../doc/src/images/warning.png"></td>
173 <th align="left">Warning</th>
175 <tr><td align="left" valign="top"><p>Since Boost version 1.36 the behaviour of this constructor has changed. Now it creates a space optimized circular buffer with zero capacity. </p></td></tr>
179 <div class="variablelist"><table border="0" class="variablelist compact">
181 <col align="left" valign="top">
186 <td><p><span class="term">Parameters:</span></p></td>
187 <td><div class="variablelist"><table border="0" class="variablelist compact">
189 <col align="left" valign="top">
193 <td><p><span class="term"><code class="computeroutput">alloc</code></span></p></td>
194 <td><p>The allocator. </p></td>
199 <td><p><span class="term">Postconditions:</span></p></td>
200 <td><p><code class="computeroutput">capacity().capacity() == 0 && capacity().min_capacity() == 0 && size() == 0</code> </p></td>
203 <td><p><span class="term">Throws:</span></p></td>
209 <li class="listitem">
210 <pre class="literallayout"><span class="keyword">explicit</span> <a name="idm45097335201280-bb"></a><span class="identifier">circular_buffer_space_optimized</span><span class="special">(</span><span class="identifier">capacity_type</span> capacity_ctrl<span class="special">,</span>
211 <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&</span> alloc <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>Create an empty space optimized circular buffer with the specified capacity. <p>
215 <p><b>Complexity. </b>Constant. </p>
218 <div class="variablelist"><table border="0" class="variablelist compact">
220 <col align="left" valign="top">
225 <td><p><span class="term">Parameters:</span></p></td>
226 <td><div class="variablelist"><table border="0" class="variablelist compact">
228 <col align="left" valign="top">
233 <td><p><span class="term"><code class="computeroutput">alloc</code></span></p></td>
234 <td><p>The allocator. </p></td>
237 <td><p><span class="term"><code class="computeroutput">capacity_ctrl</code></span></p></td>
238 <td><p>The capacity controller representing the maximum number of elements which can be stored in the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> and the minimal allocated size of the internal buffer. </p></td>
244 <td><p><span class="term">Postconditions:</span></p></td>
245 <td><p><code class="computeroutput">capacity() == capacity_ctrl && size() == 0</code><br>
247 The amount of allocated memory in the internal buffer is <code class="computeroutput">capacity_ctrl.min_capacity()</code>. </p></td>
250 <td><p><span class="term">Throws:</span></p></td>
251 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). </td>
256 <li class="listitem">
257 <pre class="literallayout"><a name="idm45097335192416-bb"></a><span class="identifier">circular_buffer_space_optimized</span><span class="special">(</span><span class="identifier">capacity_type</span> capacity_ctrl<span class="special">,</span>
258 <span class="identifier">param_value_type</span> item<span class="special">,</span>
259 <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&</span> alloc <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>Create a full space optimized circular buffer with the specified capacity filled with <code class="computeroutput">capacity_ctrl.capacity()</code> copies of <code class="computeroutput">item</code>. <p>
263 <p><b>Complexity. </b>Linear (in the <code class="computeroutput">capacity_ctrl.capacity()</code>). </p>
266 <div class="variablelist"><table border="0" class="variablelist compact">
268 <col align="left" valign="top">
273 <td><p><span class="term">Parameters:</span></p></td>
274 <td><div class="variablelist"><table border="0" class="variablelist compact">
276 <col align="left" valign="top">
281 <td><p><span class="term"><code class="computeroutput">alloc</code></span></p></td>
282 <td><p>The allocator. </p></td>
285 <td><p><span class="term"><code class="computeroutput">capacity_ctrl</code></span></p></td>
286 <td><p>The capacity controller representing the maximum number of elements which can be stored in the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> and the minimal allocated size of the internal buffer. </p></td>
289 <td><p><span class="term"><code class="computeroutput">item</code></span></p></td>
290 <td><p>The element the created <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> will be filled with. </p></td>
296 <td><p><span class="term">Postconditions:</span></p></td>
297 <td><p><code class="computeroutput">capacity() == capacity_ctrl && full() && (*this)[0] == item && (*this)[1] == item && ... && (*this) [capacity_ctrl.capacity() - 1] == item </code><br>
299 The amount of allocated memory in the internal buffer is <code class="computeroutput">capacity_ctrl.capacity()</code>. </p></td>
302 <td><p><span class="term">Throws:</span></p></td>
303 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). <code class="computeroutput">T::T(const T&)</code> throws. </td>
308 <li class="listitem">
309 <pre class="literallayout"><a name="idm45097335179904-bb"></a><span class="identifier">circular_buffer_space_optimized</span><span class="special">(</span><span class="identifier">capacity_type</span> capacity_ctrl<span class="special">,</span> <span class="identifier">size_type</span> n<span class="special">,</span>
310 <span class="identifier">param_value_type</span> item<span class="special">,</span>
311 <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&</span> alloc <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>Create a space optimized circular buffer with the specified capacity filled with <code class="computeroutput">n</code> copies of <code class="computeroutput">item</code>. <p>
316 <p><b>Complexity. </b>Linear (in the <code class="computeroutput">n</code>). </p>
319 <div class="variablelist"><table border="0" class="variablelist compact">
321 <col align="left" valign="top">
326 <td><p><span class="term">Parameters:</span></p></td>
327 <td><div class="variablelist"><table border="0" class="variablelist compact">
329 <col align="left" valign="top">
334 <td><p><span class="term"><code class="computeroutput">alloc</code></span></p></td>
335 <td><p>The allocator. </p></td>
338 <td><p><span class="term"><code class="computeroutput">capacity_ctrl</code></span></p></td>
339 <td><p>The capacity controller representing the maximum number of elements which can be stored in the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> and the minimal allocated size of the internal buffer. </p></td>
342 <td><p><span class="term"><code class="computeroutput">item</code></span></p></td>
343 <td><p>The element the created <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> will be filled with. </p></td>
346 <td><p><span class="term"><code class="computeroutput">n</code></span></p></td>
347 <td><p>The number of elements the created <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> will be filled with. </p></td>
353 <td><p><span class="term">Requires:</span></p></td>
354 <td><p><code class="computeroutput">capacity_ctrl.capacity() >= n</code> </p></td>
357 <td><p><span class="term">Postconditions:</span></p></td>
358 <td><p><code class="computeroutput">capacity() == capacity_ctrl && size() == n && (*this)[0] == item && (*this)[1] == item && ... && (*this)[n - 1] == item</code><br>
360 The amount of allocated memory in the internal buffer is <code class="computeroutput">max[n, capacity_ctrl.min_capacity()]</code>. </p></td>
363 <td><p><span class="term">Throws:</span></p></td>
364 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T(const T&)</code> throws. </td>
369 <li class="listitem">
370 <pre class="literallayout"><a name="idm45097335164560-bb"></a><span class="identifier">circular_buffer_space_optimized</span><span class="special">(</span><span class="keyword">const</span> <a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span> <span class="special">&</span> cb<span class="special">)</span><span class="special">;</span></pre>The copy constructor. <p>Creates a copy of the specified <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>.
374 <p><b>Complexity. </b>Linear (in the size of <code class="computeroutput">cb</code>). </p>
377 <div class="variablelist"><table border="0" class="variablelist compact">
379 <col align="left" valign="top">
384 <td><p><span class="term">Parameters:</span></p></td>
385 <td><div class="variablelist"><table border="0" class="variablelist compact">
387 <col align="left" valign="top">
391 <td><p><span class="term"><code class="computeroutput">cb</code></span></p></td>
392 <td><p>The <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> to be copied. </p></td>
397 <td><p><span class="term">Postconditions:</span></p></td>
398 <td><p><code class="computeroutput">*this == cb</code><br>
400 The amount of allocated memory in the internal buffer is <code class="computeroutput">cb.size()</code>. </p></td>
403 <td><p><span class="term">Throws:</span></p></td>
404 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T(const T&)</code> throws. </td>
409 <li class="listitem">
410 <pre class="literallayout"><a name="idm45097335155328-bb"></a><span class="identifier">circular_buffer_space_optimized</span><span class="special">(</span><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span> <span class="special">&&</span> cb<span class="special">)</span> <span class="keyword">noexcept</span><span class="special">;</span></pre>The move constructor. <p>Move constructs a <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> from <code class="computeroutput">cb</code>, leaving <code class="computeroutput">cb</code> empty.
415 <p><b>Constant. </b></p>
418 <div class="variablelist"><table border="0" class="variablelist compact">
420 <col align="left" valign="top">
425 <td><p><span class="term">Parameters:</span></p></td>
426 <td><div class="variablelist"><table border="0" class="variablelist compact">
428 <col align="left" valign="top">
432 <td><p><span class="term"><code class="computeroutput">cb</code></span></p></td>
433 <td><p><code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_buffer.html" title="Class template circular_buffer">circular_buffer</a></code></code> to 'steal' value from. </p></td>
438 <td><p><span class="term">Requires:</span></p></td>
439 <td><p>C++ compiler with rvalue references support. </p></td>
442 <td><p><span class="term">Postconditions:</span></p></td>
443 <td><p><code class="computeroutput">cb.empty()</code> </p></td>
446 <td><p><span class="term">Throws:</span></p></td>
452 <li class="listitem">
453 <pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">></span>
454 <a name="idm45097335147136-bb"></a><span class="identifier">circular_buffer_space_optimized</span><span class="special">(</span><span class="identifier">InputIterator</span> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">,</span>
455 <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&</span> alloc <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>Create a full space optimized circular buffer filled with a copy of the range. <p>
460 <p><b>Complexity. </b>Linear (in the <code class="computeroutput">std::distance(first, last)</code>). </p>
463 <div class="variablelist"><table border="0" class="variablelist compact">
465 <col align="left" valign="top">
470 <td><p><span class="term">Parameters:</span></p></td>
471 <td><div class="variablelist"><table border="0" class="variablelist compact">
473 <col align="left" valign="top">
478 <td><p><span class="term"><code class="computeroutput">alloc</code></span></p></td>
479 <td><p>The allocator. </p></td>
482 <td><p><span class="term"><code class="computeroutput">first</code></span></p></td>
483 <td><p>The beginning of the range to be copied. </p></td>
486 <td><p><span class="term"><code class="computeroutput">last</code></span></p></td>
487 <td><p>The end of the range to be copied. </p></td>
493 <td><p><span class="term">Requires:</span></p></td>
494 <td><p>Valid range <code class="computeroutput">[first, last)</code>.<br>
495 <code class="computeroutput">first</code> and <code class="computeroutput">last</code> have to meet the requirements of <a href="https://www.boost.org/sgi/stl/InputIterator.html" target="_top">InputIterator</a>. </p></td>
498 <td><p><span class="term">Postconditions:</span></p></td>
499 <td><p><code class="computeroutput">capacity().capacity() == std::distance(first, last) && capacity().min_capacity() == 0 && full() && (*this)[0]== *first && (*this)[1] == *(first + 1) && ... && (*this)[std::distance(first, last) - 1] == *(last - 1)</code><br>
501 The amount of allocated memory in the internal buffer is <code class="computeroutput">std::distance(first, last)</code>. </p></td>
504 <td><p><span class="term">Throws:</span></p></td>
505 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T(const T&)</code> throws or nothing if <code class="computeroutput">T::T(T&&)</code> is noexcept and <code class="computeroutput">InputIterator</code> is a move iterator. </td>
510 <li class="listitem">
511 <pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">></span>
512 <a name="idm45097335132592-bb"></a><span class="identifier">circular_buffer_space_optimized</span><span class="special">(</span><span class="identifier">capacity_type</span> capacity_ctrl<span class="special">,</span>
513 <span class="identifier">InputIterator</span> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">,</span>
514 <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&</span> alloc <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>Create a space optimized circular buffer with the specified capacity (and the minimal guaranteed amount of allocated memory) filled with a copy of the range. <p>
519 <p><b>Complexity. </b>Linear (in <code class="computeroutput">std::distance(first, last)</code>; in <code class="computeroutput">min[capacity_ctrl.capacity(), std::distance(first, last)]</code> if the <code class="computeroutput">InputIterator</code> is a <a href="https://www.boost.org/sgi/stl/RandomAccessIterator.html" target="_top">RandomAccessIterator</a>). </p>
522 <div class="variablelist"><table border="0" class="variablelist compact">
524 <col align="left" valign="top">
529 <td><p><span class="term">Parameters:</span></p></td>
530 <td><div class="variablelist"><table border="0" class="variablelist compact">
532 <col align="left" valign="top">
537 <td><p><span class="term"><code class="computeroutput">alloc</code></span></p></td>
538 <td><p>The allocator. </p></td>
541 <td><p><span class="term"><code class="computeroutput">capacity_ctrl</code></span></p></td>
542 <td><p>The capacity controller representing the maximum number of elements which can be stored in the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> and the minimal allocated size of the internal buffer. </p></td>
545 <td><p><span class="term"><code class="computeroutput">first</code></span></p></td>
546 <td><p>The beginning of the range to be copied. </p></td>
549 <td><p><span class="term"><code class="computeroutput">last</code></span></p></td>
550 <td><p>The end of the range to be copied. </p></td>
556 <td><p><span class="term">Requires:</span></p></td>
557 <td><p>Valid range <code class="computeroutput">[first, last)</code>.<br>
558 <code class="computeroutput">first</code> and <code class="computeroutput">last</code> have to meet the requirements of <a href="https://www.boost.org/sgi/stl/InputIterator.html" target="_top">InputIterator</a>. </p></td>
561 <td><p><span class="term">Postconditions:</span></p></td>
562 <td><p><code class="computeroutput">capacity() == capacity_ctrl && size() <= std::distance(first, last) && (*this)[0]== (last - capacity_ctrl.capacity()) && (*this)[1] == *(last - capacity_ctrl.capacity() + 1) && ... && (*this)[capacity_ctrl.capacity() - 1] == *(last - 1)</code><br>
564 If the number of items to be copied from the range <code class="computeroutput">[first, last)</code> is greater than the specified <code class="computeroutput">capacity_ctrl.capacity()</code> then only elements from the range <code class="computeroutput">[last - capacity_ctrl.capacity(), last)</code> will be copied.<br>
566 The amount of allocated memory in the internal buffer is <code class="computeroutput">max[capacity_ctrl.min_capacity(), min[capacity_ctrl.capacity(), std::distance(first, last)]]</code>. </p></td>
569 <td><p><span class="term">Throws:</span></p></td>
570 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T(const T&)</code> throws. </td>
575 <li class="listitem">
576 <pre class="literallayout"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span> <span class="special">&</span>
577 <a name="idm45097335112944-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span><span class="keyword">const</span> <a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span> <span class="special">&</span> cb<span class="special">)</span><span class="special">;</span></pre>The assign operator. <p>Makes this <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> to become a copy of the specified <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>.
581 <p><b>Exception Safety. </b>Strong. </p>
584 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to this <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
587 <p><b>Complexity. </b>Linear (in the size of <code class="computeroutput">cb</code>). </p>
590 <p><span class="bold"><strong>See Also:</strong></span></p>
591 <p><code class="computeroutput">assign(size_type, const_reference)</code>, <code class="computeroutput">assign(capacity_type, size_type, const_reference)</code>, <code class="computeroutput">assign(InputIterator, InputIterator)</code>, <code class="computeroutput">assign(capacity_type, InputIterator, InputIterator)</code> </p>
596 <div class="variablelist"><table border="0" class="variablelist compact">
598 <col align="left" valign="top">
603 <td><p><span class="term">Parameters:</span></p></td>
604 <td><div class="variablelist"><table border="0" class="variablelist compact">
606 <col align="left" valign="top">
610 <td><p><span class="term"><code class="computeroutput">cb</code></span></p></td>
611 <td><p>The <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> to be copied. </p></td>
616 <td><p><span class="term">Postconditions:</span></p></td>
617 <td><p><code class="computeroutput">*this == cb</code><br>
619 The amount of allocated memory in the internal buffer is <code class="computeroutput">cb.size()</code>. </p></td>
622 <td><p><span class="term">Throws:</span></p></td>
623 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). <code class="computeroutput">T::T(const T&)</code> throws. </td>
628 <li class="listitem">
629 <pre class="literallayout"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span> <span class="special">&</span>
630 <a name="idm45097335095808-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span> <span class="special">&&</span> cb<span class="special">)</span> <span class="keyword">noexcept</span><span class="special">;</span></pre>Move assigns content of <code class="computeroutput">cb</code> to <code class="computeroutput">*this</code>, leaving <code class="computeroutput">cb</code> empty. <p>
635 <p><b>Complexity. </b>Constant. </p>
638 <div class="variablelist"><table border="0" class="variablelist compact">
640 <col align="left" valign="top">
645 <td><p><span class="term">Parameters:</span></p></td>
646 <td><div class="variablelist"><table border="0" class="variablelist compact">
648 <col align="left" valign="top">
652 <td><p><span class="term"><code class="computeroutput">cb</code></span></p></td>
653 <td><p><code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_buffer.html" title="Class template circular_buffer">circular_buffer</a></code></code> to 'steal' value from. </p></td>
658 <td><p><span class="term">Requires:</span></p></td>
659 <td><p>C++ compiler with rvalue references support. </p></td>
662 <td><p><span class="term">Postconditions:</span></p></td>
663 <td><p><code class="computeroutput">cb.empty()</code> </p></td>
666 <td><p><span class="term">Throws:</span></p></td>
674 <div class="refsect2">
675 <a name="id-1.3.9.16.4.3.4.4"></a><h3>
676 <a name="idm45097335939008-bb"></a><code class="computeroutput">circular_buffer_space_optimized</code> public member functions</h3>
677 <div class="orderedlist"><ol class="orderedlist" type="1">
678 <li class="listitem">
679 <pre class="literallayout"><span class="keyword">bool</span> <a name="idm45097335938448-bb"></a><span class="identifier">full</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span> <span class="keyword">noexcept</span><span class="special">;</span></pre>Is the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> full? <p>
682 <p><b>Exception Safety. </b>No-throw. </p>
685 <p><b>Iterator Invalidation. </b>Does not invalidate any iterators. </p>
688 <p><b>Complexity. </b>Constant (in the size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>). </p>
691 <p><span class="bold"><strong>See Also:</strong></span></p>
692 <p><code class="computeroutput">empty()</code> </p>
697 <div class="variablelist"><table border="0" class="variablelist compact">
699 <col align="left" valign="top">
704 <td><p><span class="term">Returns:</span></p></td>
705 <td><p><code class="computeroutput">true</code> if the number of elements stored in the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> equals the capacity of the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code>; <code class="computeroutput">false</code> otherwise. </p></td>
708 <td><p><span class="term">Throws:</span></p></td>
714 <li class="listitem">
715 <pre class="literallayout"><span class="identifier">size_type</span> <a name="idm45097335926352-bb"></a><span class="identifier">reserve</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span> <span class="keyword">noexcept</span><span class="special">;</span></pre>Get the maximum number of elements which can be inserted into the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> without overwriting any of already stored elements. <p>
718 <p><b>Exception Safety. </b>No-throw. </p>
721 <p><b>Iterator Invalidation. </b>Does not invalidate any iterators. </p>
724 <p><b>Complexity. </b>Constant (in the size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>). </p>
727 <p><span class="bold"><strong>See Also:</strong></span></p>
728 <p><code class="computeroutput">capacity()</code>, <code class="computeroutput">size()</code>, <code class="computeroutput">max_size()</code> </p>
733 <div class="variablelist"><table border="0" class="variablelist compact">
735 <col align="left" valign="top">
740 <td><p><span class="term">Returns:</span></p></td>
741 <td><p><code class="computeroutput">capacity().capacity() - size()</code> </p></td>
744 <td><p><span class="term">Throws:</span></p></td>
750 <li class="listitem">
751 <pre class="literallayout"><span class="keyword">const</span> <span class="identifier">capacity_type</span> <span class="special">&</span> <a name="idm45097335915520-bb"></a><span class="identifier">capacity</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span> <span class="keyword">noexcept</span><span class="special">;</span></pre>Get the capacity of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>. <p>
754 <p><b>Exception Safety. </b>No-throw. </p>
757 <p><b>Iterator Invalidation. </b>Does not invalidate any iterators. </p>
760 <p><b>Complexity. </b>Constant (in the size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>). </p>
763 <p><span class="bold"><strong>See Also:</strong></span></p>
764 <p><code class="computeroutput">reserve()</code>, <code class="computeroutput">size()</code>, <code class="computeroutput">max_size()</code>, <code class="computeroutput">set_capacity(const capacity_type&)</code> </p>
769 <div class="variablelist"><table border="0" class="variablelist compact">
771 <col align="left" valign="top">
776 <td><p><span class="term">Returns:</span></p></td>
777 <td><p>The capacity controller representing the maximum number of elements which can be stored in the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> and the minimal allocated size of the internal buffer. </p></td>
780 <td><p><span class="term">Throws:</span></p></td>
786 <li class="listitem">
787 <pre class="literallayout"><span class="keyword">void</span> <a name="idm45097335903584-bb"></a><span class="identifier">set_capacity</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">capacity_type</span> <span class="special">&</span> capacity_ctrl<span class="special">)</span><span class="special">;</span></pre>Change the capacity (and the minimal guaranteed amount of allocated memory) of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>. <p>
791 <p><b>Exception Safety. </b>Strong. </p>
794 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
797 <p><b>Complexity. </b>Linear (in <code class="computeroutput">min[size(), capacity_ctrl.capacity()]</code>). </p>
800 <div class="note"><table border="0" summary="Note">
802 <td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../doc/src/images/note.png"></td>
803 <th align="left">Note</th>
805 <tr><td align="left" valign="top"><p>To explicitly clear the extra allocated memory use the <span class="bold"><strong>shrink-to-fit</strong></span> technique:<br>
807 <code class="computeroutput">boost::circular_buffer_space_optimized<int> cb(1000);<br>
809 boost::circular_buffer_space_optimized<int>(cb).swap(cb);</code><br>
811 For more information about the shrink-to-fit technique in STL see <a href="http://www.gotw.ca/gotw/054.htm" target="_top">http://www.gotw.ca/gotw/054.htm</a>. </p></td></tr>
815 <p><span class="bold"><strong>See Also:</strong></span></p>
816 <p><code class="computeroutput">rset_capacity(const capacity_type&)</code>, <code class="computeroutput">resize(size_type, const_reference)</code> </p>
821 <div class="variablelist"><table border="0" class="variablelist compact">
823 <col align="left" valign="top">
828 <td><p><span class="term">Parameters:</span></p></td>
829 <td><div class="variablelist"><table border="0" class="variablelist compact">
831 <col align="left" valign="top">
835 <td><p><span class="term"><code class="computeroutput">capacity_ctrl</code></span></p></td>
836 <td><p>The new capacity controller. </p></td>
841 <td><p><span class="term">Postconditions:</span></p></td>
842 <td><p><code class="computeroutput">capacity() == capacity_ctrl && size() <= capacity_ctrl.capacity()</code><br>
844 If the current number of elements stored in the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> is greater than the desired new capacity then number of <code class="computeroutput">[size() - capacity_ctrl.capacity()]</code> <span class="bold"><strong>last</strong></span> elements will be removed and the new size will be equal to <code class="computeroutput">capacity_ctrl.capacity()</code>.<br>
846 If the current number of elements stored in the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> is lower than the new capacity then the amount of allocated memory in the internal buffer may be accommodated as necessary but it will never drop below <code class="computeroutput">capacity_ctrl.min_capacity()</code>. </p></td>
849 <td><p><span class="term">Throws:</span></p></td>
850 <td>An allocation error if memory is exhausted, (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T(const T&)</code> throws or nothing if <code class="computeroutput">T::T(T&&)</code> is noexcept. </td>
855 <li class="listitem">
856 <pre class="literallayout"><span class="keyword">void</span> <a name="idm45097335880432-bb"></a><span class="identifier">resize</span><span class="special">(</span><span class="identifier">size_type</span> new_size<span class="special">,</span> <span class="identifier">param_value_type</span> item <span class="special">=</span> <span class="identifier">value_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>Change the size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>. <p>
860 <p><b>Exception Safety. </b>Basic. </p>
863 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
866 <p><b>Complexity. </b>Linear (in the new size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>). </p>
869 <p><span class="bold"><strong>See Also:</strong></span></p>
870 <p><code class="computeroutput">rresize(size_type, const_reference)</code>, <code class="computeroutput">set_capacity(const capacity_type&)</code> </p>
875 <div class="variablelist"><table border="0" class="variablelist compact">
877 <col align="left" valign="top">
882 <td><p><span class="term">Parameters:</span></p></td>
883 <td><div class="variablelist"><table border="0" class="variablelist compact">
885 <col align="left" valign="top">
890 <td><p><span class="term"><code class="computeroutput">item</code></span></p></td>
891 <td><p>The element the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> will be filled with in order to gain the requested size. (See the <span class="emphasis"><em>Effect</em></span>.) </p></td>
894 <td><p><span class="term"><code class="computeroutput">new_size</code></span></p></td>
895 <td><p>The new size. </p></td>
901 <td><p><span class="term">Postconditions:</span></p></td>
902 <td><p><code class="computeroutput">size() == new_size && capacity().capacity() >= new_size</code><br>
904 If the new size is greater than the current size, copies of <code class="computeroutput">item</code> will be inserted at the <span class="bold"><strong>back</strong></span> of the of the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> in order to achieve the desired size. In the case the resulting size exceeds the current capacity the capacity will be set to <code class="computeroutput">new_size</code>.<br>
906 If the current number of elements stored in the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> is greater than the desired new size then number of <code class="computeroutput">[size() - new_size]</code> <span class="bold"><strong>last</strong></span> elements will be removed. (The capacity will remain unchanged.)<br>
908 The amount of allocated memory in the internal buffer may be accommodated as necessary. </p></td>
911 <td><p><span class="term">Throws:</span></p></td>
912 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T(const T&)</code> throws. </td>
917 <li class="listitem">
918 <pre class="literallayout"><span class="keyword">void</span> <a name="idm45097335857696-bb"></a><span class="identifier">rset_capacity</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">capacity_type</span> <span class="special">&</span> capacity_ctrl<span class="special">)</span><span class="special">;</span></pre>Change the capacity (and the minimal guaranteed amount of allocated memory) of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>. <p>
922 <p><b>Exception Safety. </b>Strong. </p>
925 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
928 <p><b>Complexity. </b>Linear (in <code class="computeroutput">min[size(), capacity_ctrl.capacity()]</code>). </p>
931 <p><span class="bold"><strong>See Also:</strong></span></p>
932 <p><code class="computeroutput">set_capacity(const capacity_type&)</code>, <code class="computeroutput">rresize(size_type, const_reference)</code> </p>
937 <div class="variablelist"><table border="0" class="variablelist compact">
939 <col align="left" valign="top">
944 <td><p><span class="term">Parameters:</span></p></td>
945 <td><div class="variablelist"><table border="0" class="variablelist compact">
947 <col align="left" valign="top">
951 <td><p><span class="term"><code class="computeroutput">capacity_ctrl</code></span></p></td>
952 <td><p>The new capacity controller. </p></td>
957 <td><p><span class="term">Postconditions:</span></p></td>
958 <td><p><code class="computeroutput">capacity() == capacity_ctrl && size() <= capacity_ctrl</code><br>
960 If the current number of elements stored in the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> is greater than the desired new capacity then number of <code class="computeroutput">[size() - capacity_ctrl.capacity()]</code> <span class="bold"><strong>first</strong></span> elements will be removed and the new size will be equal to <code class="computeroutput">capacity_ctrl.capacity()</code>.<br>
962 If the current number of elements stored in the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> is lower than the new capacity then the amount of allocated memory in the internal buffer may be accommodated as necessary but it will never drop below <code class="computeroutput">capacity_ctrl.min_capacity()</code>. </p></td>
965 <td><p><span class="term">Throws:</span></p></td>
966 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T(const T&)</code> throws or nothing if <code class="computeroutput">T::T(T&&)</code> is noexcept. </td>
971 <li class="listitem">
972 <pre class="literallayout"><span class="keyword">void</span> <a name="idm45097335838944-bb"></a><span class="identifier">rresize</span><span class="special">(</span><span class="identifier">size_type</span> new_size<span class="special">,</span> <span class="identifier">param_value_type</span> item <span class="special">=</span> <span class="identifier">value_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>Change the size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>. <p>
976 <p><b>Exception Safety. </b>Basic. </p>
979 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
982 <p><b>Complexity. </b>Linear (in the new size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>). </p>
985 <p><span class="bold"><strong>See Also:</strong></span></p>
986 <p><code class="computeroutput">resize(size_type, const_reference)</code>, <code class="computeroutput">rset_capacity(const capacity_type&)</code> </p>
991 <div class="variablelist"><table border="0" class="variablelist compact">
993 <col align="left" valign="top">
998 <td><p><span class="term">Parameters:</span></p></td>
999 <td><div class="variablelist"><table border="0" class="variablelist compact">
1001 <col align="left" valign="top">
1006 <td><p><span class="term"><code class="computeroutput">item</code></span></p></td>
1007 <td><p>The element the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> will be filled with in order to gain the requested size. (See the <span class="emphasis"><em>Effect</em></span>.) </p></td>
1010 <td><p><span class="term"><code class="computeroutput">new_size</code></span></p></td>
1011 <td><p>The new size. </p></td>
1017 <td><p><span class="term">Postconditions:</span></p></td>
1018 <td><p><code class="computeroutput">size() == new_size && capacity().capacity() >= new_size</code><br>
1020 If the new size is greater than the current size, copies of <code class="computeroutput">item</code> will be inserted at the <span class="bold"><strong>front</strong></span> of the of the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> in order to achieve the desired size. In the case the resulting size exceeds the current capacity the capacity will be set to <code class="computeroutput">new_size</code>.<br>
1022 If the current number of elements stored in the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> is greater than the desired new size then number of <code class="computeroutput">[size() - new_size]</code> <span class="bold"><strong>first</strong></span> elements will be removed. (The capacity will remain unchanged.)<br>
1024 The amount of allocated memory in the internal buffer may be accommodated as necessary. </p></td>
1027 <td><p><span class="term">Throws:</span></p></td>
1028 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T(const T&)</code> throws. </td>
1033 <li class="listitem">
1034 <pre class="literallayout"><span class="keyword">void</span> <a name="idm45097335816208-bb"></a><span class="identifier">assign</span><span class="special">(</span><span class="identifier">size_type</span> n<span class="special">,</span> <span class="identifier">param_value_type</span> item<span class="special">)</span><span class="special">;</span></pre>Assign <code class="computeroutput">n</code> items into the space optimized circular buffer. <p>The content of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> will be removed and replaced with <code class="computeroutput">n</code> copies of the <code class="computeroutput">item</code>.
1038 <p><b>Exception Safety. </b>Basic. </p>
1041 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
1044 <p><b>Complexity. </b>Linear (in the <code class="computeroutput">n</code>). </p>
1047 <p><span class="bold"><strong>See Also:</strong></span></p>
1048 <p><code class="computeroutput">operator=</code>, <code class="computeroutput">assign(capacity_type, size_type, const_reference)</code>, <code class="computeroutput">assign(InputIterator, InputIterator)</code>, <code class="computeroutput">assign(capacity_type, InputIterator, InputIterator)</code> </p>
1053 <div class="variablelist"><table border="0" class="variablelist compact">
1055 <col align="left" valign="top">
1060 <td><p><span class="term">Parameters:</span></p></td>
1061 <td><div class="variablelist"><table border="0" class="variablelist compact">
1063 <col align="left" valign="top">
1068 <td><p><span class="term"><code class="computeroutput">item</code></span></p></td>
1069 <td><p>The element the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> will be filled with. </p></td>
1072 <td><p><span class="term"><code class="computeroutput">n</code></span></p></td>
1073 <td><p>The number of elements the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> will be filled with. </p></td>
1079 <td><p><span class="term">Postconditions:</span></p></td>
1080 <td><p><code class="computeroutput">capacity().capacity() == n && capacity().min_capacity() == 0 && size() == n && (*this)[0] == item && (*this)[1] == item && ... && (*this) [n - 1] == item</code><br>
1082 The amount of allocated memory in the internal buffer is <code class="computeroutput">n</code>. </p></td>
1085 <td><p><span class="term">Throws:</span></p></td>
1086 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T(const T&)</code> throws. </td>
1091 <li class="listitem">
1092 <pre class="literallayout"><span class="keyword">void</span> <a name="idm45097335796928-bb"></a><span class="identifier">assign</span><span class="special">(</span><span class="identifier">capacity_type</span> capacity_ctrl<span class="special">,</span> <span class="identifier">size_type</span> n<span class="special">,</span> <span class="identifier">param_value_type</span> item<span class="special">)</span><span class="special">;</span></pre>Assign <code class="computeroutput">n</code> items into the space optimized circular buffer specifying the capacity. <p>The capacity of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> will be set to the specified value and the content of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> will be removed and replaced with <code class="computeroutput">n</code> copies of the <code class="computeroutput">item</code>.
1097 <p><b>Exception Safety. </b>Basic. </p>
1100 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
1103 <p><b>Complexity. </b>Linear (in the <code class="computeroutput">n</code>). </p>
1106 <p><span class="bold"><strong>See Also:</strong></span></p>
1107 <p><code class="computeroutput">operator=</code>, <code class="computeroutput">assign(size_type, const_reference)</code>, <code class="computeroutput">assign(InputIterator, InputIterator)</code>, <code class="computeroutput">assign(capacity_type, InputIterator, InputIterator)</code> </p>
1112 <div class="variablelist"><table border="0" class="variablelist compact">
1114 <col align="left" valign="top">
1119 <td><p><span class="term">Parameters:</span></p></td>
1120 <td><div class="variablelist"><table border="0" class="variablelist compact">
1122 <col align="left" valign="top">
1127 <td><p><span class="term"><code class="computeroutput">capacity_ctrl</code></span></p></td>
1128 <td><p>The new capacity controller. </p></td>
1131 <td><p><span class="term"><code class="computeroutput">item</code></span></p></td>
1132 <td><p>The element the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> will be filled with. </p></td>
1135 <td><p><span class="term"><code class="computeroutput">n</code></span></p></td>
1136 <td><p>The number of elements the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> will be filled with. </p></td>
1142 <td><p><span class="term">Requires:</span></p></td>
1143 <td><p><code class="computeroutput">capacity_ctrl.capacity() >= n</code> </p></td>
1146 <td><p><span class="term">Postconditions:</span></p></td>
1147 <td><p><code class="computeroutput">capacity() == capacity_ctrl && size() == n && (*this)[0] == item && (*this)[1] == item && ... && (*this) [n - 1] == item </code><br>
1149 The amount of allocated memory will be <code class="computeroutput">max[n, capacity_ctrl.min_capacity()]</code>. </p></td>
1152 <td><p><span class="term">Throws:</span></p></td>
1153 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T(const T&)</code> throws. </td>
1158 <li class="listitem">
1159 <pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">></span>
1160 <span class="keyword">void</span> <a name="idm45097335774736-bb"></a><span class="identifier">assign</span><span class="special">(</span><span class="identifier">InputIterator</span> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">)</span><span class="special">;</span></pre>Assign a copy of the range into the space optimized circular buffer. <p>The content of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> will be removed and replaced with copies of elements from the specified range.
1165 <p><b>Exception Safety. </b>Basic. </p>
1168 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
1171 <p><b>Complexity. </b>Linear (in the <code class="computeroutput">std::distance(first, last)</code>). </p>
1174 <p><span class="bold"><strong>See Also:</strong></span></p>
1175 <p><code class="computeroutput">operator=</code>, <code class="computeroutput">assign(size_type, const_reference)</code>, <code class="computeroutput">assign(capacity_type, size_type, const_reference)</code>, <code class="computeroutput">assign(capacity_type, InputIterator, InputIterator)</code> </p>
1180 <div class="variablelist"><table border="0" class="variablelist compact">
1182 <col align="left" valign="top">
1187 <td><p><span class="term">Parameters:</span></p></td>
1188 <td><div class="variablelist"><table border="0" class="variablelist compact">
1190 <col align="left" valign="top">
1195 <td><p><span class="term"><code class="computeroutput">first</code></span></p></td>
1196 <td><p>The beginning of the range to be copied. </p></td>
1199 <td><p><span class="term"><code class="computeroutput">last</code></span></p></td>
1200 <td><p>The end of the range to be copied. </p></td>
1206 <td><p><span class="term">Requires:</span></p></td>
1207 <td><p>Valid range <code class="computeroutput">[first, last)</code>.<br>
1208 <code class="computeroutput">first</code> and <code class="computeroutput">last</code> have to meet the requirements of <a href="https://www.boost.org/sgi/stl/InputIterator.html" target="_top">InputIterator</a>. </p></td>
1211 <td><p><span class="term">Postconditions:</span></p></td>
1212 <td><p><code class="computeroutput">capacity().capacity() == std::distance(first, last) && capacity().min_capacity() == 0 && size() == std::distance(first, last) && (*this)[0]== *first && (*this)[1] == *(first + 1) && ... && (*this)[std::distance(first, last) - 1] == *(last - 1)</code><br>
1214 The amount of allocated memory in the internal buffer is <code class="computeroutput">std::distance(first, last)</code>. </p></td>
1217 <td><p><span class="term">Throws:</span></p></td>
1218 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T(const T&)</code> throws or nothing if <code class="computeroutput">T::T(T&&)</code> is noexcept and <code class="computeroutput">InputIterator</code> is a move iterator. </td>
1223 <li class="listitem">
1224 <pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">></span>
1225 <span class="keyword">void</span> <a name="idm45097335753632-bb"></a><span class="identifier">assign</span><span class="special">(</span><span class="identifier">capacity_type</span> capacity_ctrl<span class="special">,</span> <span class="identifier">InputIterator</span> first<span class="special">,</span>
1226 <span class="identifier">InputIterator</span> last<span class="special">)</span><span class="special">;</span></pre>Assign a copy of the range into the space optimized circular buffer specifying the capacity. <p>The capacity of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> will be set to the specified value and the content of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> will be removed and replaced with copies of elements from the specified range.
1231 <p><b>Exception Safety. </b>Basic. </p>
1234 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
1237 <p><b>Complexity. </b>Linear (in <code class="computeroutput">std::distance(first, last)</code>; in <code class="computeroutput">min[capacity_ctrl.capacity(), std::distance(first, last)]</code> if the <code class="computeroutput">InputIterator</code> is a <a href="https://www.boost.org/sgi/stl/RandomAccessIterator.html" target="_top">RandomAccessIterator</a>). </p>
1240 <p><span class="bold"><strong>See Also:</strong></span></p>
1241 <p><code class="computeroutput">operator=</code>, <code class="computeroutput">assign(size_type, const_reference)</code>, <code class="computeroutput">assign(capacity_type, size_type, const_reference)</code>, <code class="computeroutput">assign(InputIterator, InputIterator)</code> </p>
1246 <div class="variablelist"><table border="0" class="variablelist compact">
1248 <col align="left" valign="top">
1253 <td><p><span class="term">Parameters:</span></p></td>
1254 <td><div class="variablelist"><table border="0" class="variablelist compact">
1256 <col align="left" valign="top">
1261 <td><p><span class="term"><code class="computeroutput">capacity_ctrl</code></span></p></td>
1262 <td><p>The new capacity controller. </p></td>
1265 <td><p><span class="term"><code class="computeroutput">first</code></span></p></td>
1266 <td><p>The beginning of the range to be copied. </p></td>
1269 <td><p><span class="term"><code class="computeroutput">last</code></span></p></td>
1270 <td><p>The end of the range to be copied. </p></td>
1276 <td><p><span class="term">Requires:</span></p></td>
1277 <td><p>Valid range <code class="computeroutput">[first, last)</code>.<br>
1278 <code class="computeroutput">first</code> and <code class="computeroutput">last</code> have to meet the requirements of <a href="https://www.boost.org/sgi/stl/InputIterator.html" target="_top">InputIterator</a>. </p></td>
1281 <td><p><span class="term">Postconditions:</span></p></td>
1282 <td><p><code class="computeroutput">capacity() == capacity_ctrl && size() <= std::distance(first, last) && (*this)[0]== *(last - capacity) && (*this)[1] == *(last - capacity + 1) && ... && (*this)[capacity - 1] == *(last - 1)</code><br>
1284 If the number of items to be copied from the range <code class="computeroutput">[first, last)</code> is greater than the specified <code class="computeroutput">capacity</code> then only elements from the range <code class="computeroutput">[last - capacity, last)</code> will be copied.<br>
1286 The amount of allocated memory in the internal buffer is <code class="computeroutput">max[std::distance(first, last), capacity_ctrl.min_capacity()]</code>. </p></td>
1289 <td><p><span class="term">Throws:</span></p></td>
1290 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T(const T&)</code> throws or nothing if <code class="computeroutput">T::T(T&&)</code> is noexcept and <code class="computeroutput">InputIterator</code> is a move iterator. </td>
1295 <li class="listitem">
1296 <pre class="literallayout"><span class="keyword">void</span> <a name="idm45097335726800-bb"></a><span class="identifier">swap</span><span class="special">(</span><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a><span class="special"><</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span> <span class="special">&</span> cb<span class="special">)</span> <span class="keyword">noexcept</span><span class="special">;</span></pre>Swap the contents of two space-optimized circular-buffers. <p>
1300 <p><b>Exception Safety. </b>No-throw. </p>
1303 <p><b>Iterator Invalidation. </b>Invalidates all iterators of both <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> containers. (On the other hand the iterators still point to the same elements but within another container. If you want to rely on this feature you have to turn the __debug_support off, otherwise an assertion will report an error if such invalidated iterator is used.) </p>
1306 <p><b>Complexity. </b>Constant (in the size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>). </p>
1309 <p><span class="bold"><strong>See Also:</strong></span></p>
1310 <p><code class="computeroutput">swap(circular_buffer<T, Alloc>&, circular_buffer<T, Alloc>&)</code>, <code class="computeroutput">swap(circular_buffer_space_optimized<T, Alloc>&, circular_buffer_space_optimized<T, Alloc>&)</code> </p>
1315 <div class="variablelist"><table border="0" class="variablelist compact">
1317 <col align="left" valign="top">
1322 <td><p><span class="term">Parameters:</span></p></td>
1323 <td><div class="variablelist"><table border="0" class="variablelist compact">
1325 <col align="left" valign="top">
1329 <td><p><span class="term"><code class="computeroutput">cb</code></span></p></td>
1330 <td><p>The <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> whose content will be swapped. </p></td>
1335 <td><p><span class="term">Postconditions:</span></p></td>
1336 <td><p><code class="computeroutput">this</code> contains elements of <code class="computeroutput">cb</code> and vice versa; the capacity and the amount of allocated memory in the internal buffer of <code class="computeroutput">this</code> equal to the capacity and the amount of allocated memory of <code class="computeroutput">cb</code> and vice versa. </p></td>
1339 <td><p><span class="term">Throws:</span></p></td>
1345 <li class="listitem">
1346 <pre class="literallayout"><span class="keyword">void</span> <a name="idm45097335712304-bb"></a><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">param_value_type</span> item<span class="special">)</span><span class="special">;</span></pre>Insert a new element at the end of the space optimized circular buffer. <p>
1350 <p><b>Exception Safety. </b>Basic. </p>
1353 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
1356 <p><b>Complexity. </b>Linear (in the size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>). </p>
1359 <p><span class="bold"><strong>See Also:</strong></span></p>
1360 <p><code class="computeroutput">push_front(const_reference)</code>, <code class="computeroutput">pop_back()</code>, <code class="computeroutput">pop_front()</code> </p>
1365 <div class="variablelist"><table border="0" class="variablelist compact">
1367 <col align="left" valign="top">
1372 <td><p><span class="term">Parameters:</span></p></td>
1373 <td><div class="variablelist"><table border="0" class="variablelist compact">
1375 <col align="left" valign="top">
1379 <td><p><span class="term"><code class="computeroutput">item</code></span></p></td>
1380 <td><p>The element to be inserted. </p></td>
1385 <td><p><span class="term">Postconditions:</span></p></td>
1386 <td><p>if <code class="computeroutput">capacity().capacity() > 0</code> then <code class="computeroutput">back() == item</code><br>
1387 If the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> is full, the first element will be removed. If the capacity is <code class="computeroutput">0</code>, nothing will be inserted.<br>
1389 The amount of allocated memory in the internal buffer may be predictively increased. </p></td>
1392 <td><p><span class="term">Throws:</span></p></td>
1393 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T(const T&)</code> throws. </td>
1398 <li class="listitem">
1399 <pre class="literallayout"><span class="keyword">void</span> <a name="idm45097335696432-bb"></a><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">rvalue_type</span> item<span class="special">)</span><span class="special">;</span></pre>Insert a new element at the end of the space optimized circular buffer. <p>
1403 <p><b>Exception Safety. </b>Basic. </p>
1406 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
1409 <p><b>Complexity. </b>Linear (in the size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>). </p>
1412 <p><span class="bold"><strong>See Also:</strong></span></p>
1413 <p><code class="computeroutput">push_front(const_reference)</code>, <code class="computeroutput">pop_back()</code>, <code class="computeroutput">pop_front()</code> </p>
1418 <div class="variablelist"><table border="0" class="variablelist compact">
1420 <col align="left" valign="top">
1425 <td><p><span class="term">Parameters:</span></p></td>
1426 <td><div class="variablelist"><table border="0" class="variablelist compact">
1428 <col align="left" valign="top">
1432 <td><p><span class="term"><code class="computeroutput">item</code></span></p></td>
1433 <td><p>The element to be inserted. </p></td>
1438 <td><p><span class="term">Postconditions:</span></p></td>
1439 <td><p>if <code class="computeroutput">capacity().capacity() > 0</code> then <code class="computeroutput">back() == item</code><br>
1440 If the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> is full, the first element will be removed. If the capacity is <code class="computeroutput">0</code>, nothing will be inserted.<br>
1442 The amount of allocated memory in the internal buffer may be predictively increased. </p></td>
1445 <td><p><span class="term">Throws:</span></p></td>
1446 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). </td>
1451 <li class="listitem">
1452 <pre class="literallayout"><span class="keyword">void</span> <a name="idm45097335681024-bb"></a><span class="identifier">push_back</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>Insert a new element at the end of the space optimized circular buffer. <p>
1455 <p><b>Exception Safety. </b>Basic. </p>
1458 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
1461 <p><b>Complexity. </b>Linear (in the size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>). </p>
1464 <p><span class="bold"><strong>See Also:</strong></span></p>
1465 <p><code class="computeroutput">push_front(const_reference)</code>, <code class="computeroutput">pop_back()</code>, <code class="computeroutput">pop_front()</code> </p>
1470 <div class="variablelist"><table border="0" class="variablelist compact">
1472 <col align="left" valign="top">
1477 <td><p><span class="term">Postconditions:</span></p></td>
1478 <td><p>if <code class="computeroutput">capacity().capacity() > 0</code> then <code class="computeroutput">back() == item</code><br>
1479 If the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> is full, the first element will be removed. If the capacity is <code class="computeroutput">0</code>, nothing will be inserted.<br>
1481 The amount of allocated memory in the internal buffer may be predictively increased. </p></td>
1484 <td><p><span class="term">Throws:</span></p></td>
1485 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T()</code> throws. Whatever <code class="computeroutput">T::T(const T&)</code> throws or nothing if <code class="computeroutput">T::T(T&&)</code> is noexcept. </td>
1490 <li class="listitem">
1491 <pre class="literallayout"><span class="keyword">void</span> <a name="idm45097335665376-bb"></a><span class="identifier">push_front</span><span class="special">(</span><span class="identifier">param_value_type</span> item<span class="special">)</span><span class="special">;</span></pre>Insert a new element at the beginning of the space optimized circular buffer. <p>
1495 <p><b>Exception Safety. </b>Basic. </p>
1498 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
1501 <p><b>Complexity. </b>Linear (in the size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>). </p>
1504 <p><span class="bold"><strong>See Also:</strong></span></p>
1505 <p><code class="computeroutput">push_back(const_reference)</code>, <code class="computeroutput">pop_back()</code>, <code class="computeroutput">pop_front()</code> </p>
1510 <div class="variablelist"><table border="0" class="variablelist compact">
1512 <col align="left" valign="top">
1517 <td><p><span class="term">Parameters:</span></p></td>
1518 <td><div class="variablelist"><table border="0" class="variablelist compact">
1520 <col align="left" valign="top">
1524 <td><p><span class="term"><code class="computeroutput">item</code></span></p></td>
1525 <td><p>The element to be inserted. </p></td>
1530 <td><p><span class="term">Postconditions:</span></p></td>
1531 <td><p>if <code class="computeroutput">capacity().capacity() > 0</code> then <code class="computeroutput">front() == item</code><br>
1532 If the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> is full, the last element will be removed. If the capacity is <code class="computeroutput">0</code>, nothing will be inserted.<br>
1534 The amount of allocated memory in the internal buffer may be predictively increased. </p></td>
1537 <td><p><span class="term">Throws:</span></p></td>
1538 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T(const T&)</code> throws. </td>
1543 <li class="listitem">
1544 <pre class="literallayout"><span class="keyword">void</span> <a name="idm45097335649504-bb"></a><span class="identifier">push_front</span><span class="special">(</span><span class="identifier">rvalue_type</span> item<span class="special">)</span><span class="special">;</span></pre>Insert a new element at the beginning of the space optimized circular buffer. <p>
1548 <p><b>Exception Safety. </b>Basic. </p>
1551 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
1554 <p><b>Complexity. </b>Linear (in the size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>). </p>
1557 <p><span class="bold"><strong>See Also:</strong></span></p>
1558 <p><code class="computeroutput">push_back(const_reference)</code>, <code class="computeroutput">pop_back()</code>, <code class="computeroutput">pop_front()</code> </p>
1563 <div class="variablelist"><table border="0" class="variablelist compact">
1565 <col align="left" valign="top">
1570 <td><p><span class="term">Parameters:</span></p></td>
1571 <td><div class="variablelist"><table border="0" class="variablelist compact">
1573 <col align="left" valign="top">
1577 <td><p><span class="term"><code class="computeroutput">item</code></span></p></td>
1578 <td><p>The element to be inserted. </p></td>
1583 <td><p><span class="term">Postconditions:</span></p></td>
1584 <td><p>if <code class="computeroutput">capacity().capacity() > 0</code> then <code class="computeroutput">front() == item</code><br>
1585 If the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> is full, the last element will be removed. If the capacity is <code class="computeroutput">0</code>, nothing will be inserted.<br>
1587 The amount of allocated memory in the internal buffer may be predictively increased. </p></td>
1590 <td><p><span class="term">Throws:</span></p></td>
1591 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T(const T&)</code> throws or nothing if <code class="computeroutput">T::T(T&&)</code> is noexcept. </td>
1596 <li class="listitem">
1597 <pre class="literallayout"><span class="keyword">void</span> <a name="idm45097335633184-bb"></a><span class="identifier">push_front</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>Insert a new element at the beginning of the space optimized circular buffer. <p>
1600 <p><b>Exception Safety. </b>Basic. </p>
1603 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
1606 <p><b>Complexity. </b>Linear (in the size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>). </p>
1609 <p><span class="bold"><strong>See Also:</strong></span></p>
1610 <p><code class="computeroutput">push_back(const_reference)</code>, <code class="computeroutput">pop_back()</code>, <code class="computeroutput">pop_front()</code> </p>
1615 <div class="variablelist"><table border="0" class="variablelist compact">
1617 <col align="left" valign="top">
1622 <td><p><span class="term">Postconditions:</span></p></td>
1623 <td><p>if <code class="computeroutput">capacity().capacity() > 0</code> then <code class="computeroutput">front() == item</code><br>
1624 If the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> is full, the last element will be removed. If the capacity is <code class="computeroutput">0</code>, nothing will be inserted.<br>
1626 The amount of allocated memory in the internal buffer may be predictively increased. </p></td>
1629 <td><p><span class="term">Throws:</span></p></td>
1630 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T()</code> throws. Whatever <code class="computeroutput">T::T(const T&)</code> throws or nothing if <code class="computeroutput">T::T(T&&)</code> is noexcept. </td>
1635 <li class="listitem">
1636 <pre class="literallayout"><span class="keyword">void</span> <a name="idm45097335617536-bb"></a><span class="identifier">pop_back</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>Remove the last element from the space optimized circular buffer. <p>
1640 <p><b>Exception Safety. </b>Basic. </p>
1643 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
1646 <p><b>Complexity. </b>Linear (in the size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>). </p>
1649 <p><span class="bold"><strong>See Also:</strong></span></p>
1650 <p><code class="computeroutput">pop_front()</code>, <code class="computeroutput">push_back(const_reference)</code>, <code class="computeroutput">push_front(const_reference)</code> </p>
1655 <div class="variablelist"><table border="0" class="variablelist compact">
1657 <col align="left" valign="top">
1662 <td><p><span class="term">Requires:</span></p></td>
1663 <td><p><code class="computeroutput">!empty()</code> </p></td>
1666 <td><p><span class="term">Postconditions:</span></p></td>
1667 <td><p>The last element is removed from the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code>.<br>
1669 The amount of allocated memory in the internal buffer may be predictively decreased. </p></td>
1672 <td><p><span class="term">Throws:</span></p></td>
1673 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). </td>
1678 <li class="listitem">
1679 <pre class="literallayout"><span class="keyword">void</span> <a name="idm45097335603920-bb"></a><span class="identifier">pop_front</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>Remove the first element from the space optimized circular buffer. <p>
1683 <p><b>Exception Safety. </b>Basic. </p>
1686 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
1689 <p><b>Complexity. </b>Linear (in the size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>). </p>
1692 <p><span class="bold"><strong>See Also:</strong></span></p>
1693 <p><code class="computeroutput">pop_back()</code>, <code class="computeroutput">push_back(const_reference)</code>, <code class="computeroutput">push_front(const_reference)</code> </p>
1698 <div class="variablelist"><table border="0" class="variablelist compact">
1700 <col align="left" valign="top">
1705 <td><p><span class="term">Requires:</span></p></td>
1706 <td><p><code class="computeroutput">!empty()</code> </p></td>
1709 <td><p><span class="term">Postconditions:</span></p></td>
1710 <td><p>The first element is removed from the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code>.<br>
1712 The amount of allocated memory in the internal buffer may be predictively decreased. </p></td>
1715 <td><p><span class="term">Throws:</span></p></td>
1716 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). </td>
1721 <li class="listitem">
1722 <pre class="literallayout"><span class="identifier">iterator</span> <a name="idm45097335590304-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">iterator</span> pos<span class="special">,</span> <span class="identifier">param_value_type</span> item<span class="special">)</span><span class="special">;</span></pre>Insert an element at the specified position. <p>
1728 <p><b>Exception Safety. </b>Basic. </p>
1731 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
1734 <p><b>Complexity. </b>Linear (in the size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>). </p>
1737 <p><span class="bold"><strong>See Also:</strong></span></p>
1738 <p><code class="computeroutput">insert(iterator, size_type, value_type)</code>, <code class="computeroutput">insert(iterator, InputIterator, InputIterator)</code>, <code class="computeroutput">rinsert(iterator, value_type)</code>, <code class="computeroutput">rinsert(iterator, size_type, value_type)</code>, <code class="computeroutput">rinsert(iterator, InputIterator, InputIterator)</code> </p>
1743 <div class="variablelist"><table border="0" class="variablelist compact">
1745 <col align="left" valign="top">
1750 <td><p><span class="term">Parameters:</span></p></td>
1751 <td><div class="variablelist"><table border="0" class="variablelist compact">
1753 <col align="left" valign="top">
1758 <td><p><span class="term"><code class="computeroutput">item</code></span></p></td>
1759 <td><p>The element to be inserted. </p></td>
1762 <td><p><span class="term"><code class="computeroutput">pos</code></span></p></td>
1763 <td><p>An iterator specifying the position where the <code class="computeroutput">item</code> will be inserted. </p></td>
1769 <td><p><span class="term">Requires:</span></p></td>
1770 <td><p><code class="computeroutput">pos</code> is a valid iterator pointing to the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> or its end. </p></td>
1773 <td><p><span class="term">Postconditions:</span></p></td>
1774 <td><p>The <code class="computeroutput">item</code> will be inserted at the position <code class="computeroutput">pos</code>.<br>
1775 If the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> is full, the first element will be overwritten. If the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> is full and the <code class="computeroutput">pos</code> points to <code class="computeroutput">begin()</code>, then the <code class="computeroutput">item</code> will not be inserted. If the capacity is <code class="computeroutput">0</code>, nothing will be inserted.<br>
1777 The amount of allocated memory in the internal buffer may be predictively increased. </p></td>
1780 <td><p><span class="term">Returns:</span></p></td>
1781 <td><p>Iterator to the inserted element or <code class="computeroutput">begin()</code> if the <code class="computeroutput">item</code> is not inserted. (See the <span class="emphasis"><em>Effect</em></span>.) </p></td>
1784 <td><p><span class="term">Throws:</span></p></td>
1785 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T(const T&)</code> throws. Whatever <code class="computeroutput">T::operator = (const T&)</code> throws. </td>
1790 <li class="listitem">
1791 <pre class="literallayout"><span class="identifier">iterator</span> <a name="idm45097335565280-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">iterator</span> pos<span class="special">,</span> <span class="identifier">rvalue_type</span> item<span class="special">)</span><span class="special">;</span></pre>Insert an element at the specified position. <p>
1797 <p><b>Exception Safety. </b>Basic. </p>
1800 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
1803 <p><b>Complexity. </b>Linear (in the size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>). </p>
1806 <p><span class="bold"><strong>See Also:</strong></span></p>
1807 <p><code class="computeroutput">insert(iterator, size_type, value_type)</code>, <code class="computeroutput">insert(iterator, InputIterator, InputIterator)</code>, <code class="computeroutput">rinsert(iterator, value_type)</code>, <code class="computeroutput">rinsert(iterator, size_type, value_type)</code>, <code class="computeroutput">rinsert(iterator, InputIterator, InputIterator)</code> </p>
1812 <div class="variablelist"><table border="0" class="variablelist compact">
1814 <col align="left" valign="top">
1819 <td><p><span class="term">Parameters:</span></p></td>
1820 <td><div class="variablelist"><table border="0" class="variablelist compact">
1822 <col align="left" valign="top">
1827 <td><p><span class="term"><code class="computeroutput">item</code></span></p></td>
1828 <td><p>The element to be inserted. </p></td>
1831 <td><p><span class="term"><code class="computeroutput">pos</code></span></p></td>
1832 <td><p>An iterator specifying the position where the <code class="computeroutput">item</code> will be inserted. </p></td>
1838 <td><p><span class="term">Requires:</span></p></td>
1839 <td><p><code class="computeroutput">pos</code> is a valid iterator pointing to the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> or its end. </p></td>
1842 <td><p><span class="term">Postconditions:</span></p></td>
1843 <td><p>The <code class="computeroutput">item</code> will be inserted at the position <code class="computeroutput">pos</code>.<br>
1844 If the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> is full, the first element will be overwritten. If the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> is full and the <code class="computeroutput">pos</code> points to <code class="computeroutput">begin()</code>, then the <code class="computeroutput">item</code> will not be inserted. If the capacity is <code class="computeroutput">0</code>, nothing will be inserted.<br>
1846 The amount of allocated memory in the internal buffer may be predictively increased. </p></td>
1849 <td><p><span class="term">Returns:</span></p></td>
1850 <td><p>Iterator to the inserted element or <code class="computeroutput">begin()</code> if the <code class="computeroutput">item</code> is not inserted. (See the <span class="emphasis"><em>Effect</em></span>.) </p></td>
1853 <td><p><span class="term">Throws:</span></p></td>
1854 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T(const T&)</code> throws or nothing if <code class="computeroutput">T::T(T&&)</code> is noexcept. </td>
1859 <li class="listitem">
1860 <pre class="literallayout"><span class="identifier">iterator</span> <a name="idm45097335540272-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">iterator</span> pos<span class="special">)</span><span class="special">;</span></pre>Insert an element at the specified position. <p>
1866 <p><b>Exception Safety. </b>Basic. </p>
1869 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
1872 <p><b>Complexity. </b>Linear (in the size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>). </p>
1875 <p><span class="bold"><strong>See Also:</strong></span></p>
1876 <p><code class="computeroutput">insert(iterator, size_type, value_type)</code>, <code class="computeroutput">insert(iterator, InputIterator, InputIterator)</code>, <code class="computeroutput">rinsert(iterator, value_type)</code>, <code class="computeroutput">rinsert(iterator, size_type, value_type)</code>, <code class="computeroutput">rinsert(iterator, InputIterator, InputIterator)</code> </p>
1881 <div class="variablelist"><table border="0" class="variablelist compact">
1883 <col align="left" valign="top">
1888 <td><p><span class="term">Parameters:</span></p></td>
1889 <td><div class="variablelist"><table border="0" class="variablelist compact">
1891 <col align="left" valign="top">
1895 <td><p><span class="term"><code class="computeroutput">pos</code></span></p></td>
1896 <td><p>An iterator specifying the position where the <code class="computeroutput">item</code> will be inserted. </p></td>
1901 <td><p><span class="term">Requires:</span></p></td>
1902 <td><p><code class="computeroutput">pos</code> is a valid iterator pointing to the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> or its end. </p></td>
1905 <td><p><span class="term">Postconditions:</span></p></td>
1906 <td><p>The <code class="computeroutput">item</code> will be inserted at the position <code class="computeroutput">pos</code>.<br>
1907 If the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> is full, the first element will be overwritten. If the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> is full and the <code class="computeroutput">pos</code> points to <code class="computeroutput">begin()</code>, then the <code class="computeroutput">item</code> will not be inserted. If the capacity is <code class="computeroutput">0</code>, nothing will be inserted.<br>
1909 The amount of allocated memory in the internal buffer may be predictively increased. </p></td>
1912 <td><p><span class="term">Returns:</span></p></td>
1913 <td><p>Iterator to the inserted element or <code class="computeroutput">begin()</code> if the <code class="computeroutput">item</code> is not inserted. (See the <span class="emphasis"><em>Effect</em></span>.) </p></td>
1916 <td><p><span class="term">Throws:</span></p></td>
1917 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T()</code> throws. Whatever <code class="computeroutput">T::T(const T&)</code> throws or nothing if <code class="computeroutput">T::T(T&&)</code> is noexcept. </td>
1922 <li class="listitem">
1923 <pre class="literallayout"><span class="keyword">void</span> <a name="idm45097335515936-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">iterator</span> pos<span class="special">,</span> <span class="identifier">size_type</span> n<span class="special">,</span> <span class="identifier">param_value_type</span> item<span class="special">)</span><span class="special">;</span></pre>Insert <code class="computeroutput">n</code> copies of the <code class="computeroutput">item</code> at the specified position. <p>
1928 <p><b>Exception Safety. </b>Basic. </p>
1931 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
1934 <p><b>Complexity. </b>Linear (in <code class="computeroutput">min[capacity().capacity(), size() + n]</code>). </p>
1937 <p><b>Example. </b>Consider a <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> with the capacity of 6 and the size of 4. Its internal buffer may look like the one below.<br>
1939 <code class="computeroutput">|1|2|3|4| | |</code><br>
1940 <code class="computeroutput">p ___^</code><br>
1942 After inserting 5 elements at the position <code class="computeroutput">p</code>:<br>
1944 <code class="computeroutput">insert(p, (size_t)5, 0);</code><br>
1946 actually only 4 elements get inserted and elements <code class="computeroutput">1</code> and <code class="computeroutput">2</code> are overwritten. This is due to the fact the insert operation preserves the capacity. After insertion the internal buffer looks like this:<br>
1948 <code class="computeroutput">|0|0|0|0|3|4|</code><br>
1950 For comparison if the capacity would not be preserved the internal buffer would then result in <code class="computeroutput">|1|2|0|0|0|0|0|3|4|</code>. </p>
1953 <p><span class="bold"><strong>See Also:</strong></span></p>
1954 <p><code class="computeroutput">insert(iterator, value_type)</code>, <code class="computeroutput">insert(iterator, InputIterator, InputIterator)</code>, <code class="computeroutput">rinsert(iterator, value_type)</code>, <code class="computeroutput">rinsert(iterator, size_type, value_type)</code>, <code class="computeroutput">rinsert(iterator, InputIterator, InputIterator)</code> </p>
1959 <div class="variablelist"><table border="0" class="variablelist compact">
1961 <col align="left" valign="top">
1966 <td><p><span class="term">Parameters:</span></p></td>
1967 <td><div class="variablelist"><table border="0" class="variablelist compact">
1969 <col align="left" valign="top">
1974 <td><p><span class="term"><code class="computeroutput">item</code></span></p></td>
1975 <td><p>The element whose copies will be inserted. </p></td>
1978 <td><p><span class="term"><code class="computeroutput">n</code></span></p></td>
1979 <td><p>The number of <code class="computeroutput">item</code>s the to be inserted. </p></td>
1982 <td><p><span class="term"><code class="computeroutput">pos</code></span></p></td>
1983 <td><p>An iterator specifying the position where the <code class="computeroutput">item</code>s will be inserted. </p></td>
1989 <td><p><span class="term">Requires:</span></p></td>
1990 <td><p><code class="computeroutput">pos</code> is a valid iterator pointing to the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> or its end. </p></td>
1993 <td><p><span class="term">Postconditions:</span></p></td>
1994 <td><p>The number of <code class="computeroutput">min[n, (pos - begin()) + reserve()]</code> elements will be inserted at the position <code class="computeroutput">pos</code>.<br>
1995 The number of <code class="computeroutput">min[pos - begin(), max[0, n - reserve()]]</code> elements will be overwritten at the beginning of the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code>.<br>
1996 (See <span class="emphasis"><em>Example</em></span> for the explanation.)<br>
1998 The amount of allocated memory in the internal buffer may be predictively increased. </p></td>
2001 <td><p><span class="term">Throws:</span></p></td>
2002 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T(const T&)</code> throws. Whatever <code class="computeroutput">T::operator = (const T&)</code> throws. </td>
2007 <li class="listitem">
2008 <pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">></span>
2009 <span class="keyword">void</span> <a name="idm45097335483376-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">iterator</span> pos<span class="special">,</span> <span class="identifier">InputIterator</span> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">)</span><span class="special">;</span></pre>Insert the range <code class="computeroutput">[first, last)</code> at the specified position. <p>
2014 <p><b>Exception Safety. </b>Basic. </p>
2017 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
2020 <p><b>Complexity. </b>Linear (in <code class="computeroutput">[size() + std::distance(first, last)]</code>; in <code class="computeroutput">min[capacity().capacity(), size() + std::distance(first, last)]</code> if the <code class="computeroutput">InputIterator</code> is a <a href="https://www.boost.org/sgi/stl/RandomAccessIterator.html" target="_top">RandomAccessIterator</a>). </p>
2023 <p><b>Example. </b>Consider a <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> with the capacity of 6 and the size of 4. Its internal buffer may look like the one below.<br>
2025 <code class="computeroutput">|1|2|3|4| | |</code><br>
2026 <code class="computeroutput">p ___^</code><br>
2028 After inserting a range of elements at the position <code class="computeroutput">p</code>:<br>
2030 <code class="computeroutput">int array[] = { 5, 6, 7, 8, 9 };</code><br>
2031 <code class="computeroutput">insert(p, array, array + 5);</code><br>
2033 actually only elements <code class="computeroutput">6</code>, <code class="computeroutput">7</code>, <code class="computeroutput">8</code> and <code class="computeroutput">9</code> from the specified range get inserted and elements <code class="computeroutput">1</code> and <code class="computeroutput">2</code> are overwritten. This is due to the fact the insert operation preserves the capacity. After insertion the internal buffer looks like this:<br>
2035 <code class="computeroutput">|6|7|8|9|3|4|</code><br>
2037 For comparison if the capacity would not be preserved the internal buffer would then result in <code class="computeroutput">|1|2|5|6|7|8|9|3|4|</code>. </p>
2040 <p><span class="bold"><strong>See Also:</strong></span></p>
2041 <p><code class="computeroutput">insert(iterator, value_type)</code>, <code class="computeroutput">insert(iterator, size_type, value_type)</code>, <code class="computeroutput">rinsert(iterator, value_type)</code>, <code class="computeroutput">rinsert(iterator, size_type, value_type)</code>, <code class="computeroutput">rinsert(iterator, InputIterator, InputIterator)</code> </p>
2046 <div class="variablelist"><table border="0" class="variablelist compact">
2048 <col align="left" valign="top">
2053 <td><p><span class="term">Parameters:</span></p></td>
2054 <td><div class="variablelist"><table border="0" class="variablelist compact">
2056 <col align="left" valign="top">
2061 <td><p><span class="term"><code class="computeroutput">first</code></span></p></td>
2062 <td><p>The beginning of the range to be inserted. </p></td>
2065 <td><p><span class="term"><code class="computeroutput">last</code></span></p></td>
2066 <td><p>The end of the range to be inserted. </p></td>
2069 <td><p><span class="term"><code class="computeroutput">pos</code></span></p></td>
2070 <td><p>An iterator specifying the position where the range will be inserted. </p></td>
2076 <td><p><span class="term">Requires:</span></p></td>
2077 <td><p><code class="computeroutput">pos</code> is a valid iterator pointing to the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> or its end.<br>
2078 Valid range <code class="computeroutput">[first, last)</code> where <code class="computeroutput">first</code> and <code class="computeroutput">last</code> meet the requirements of an <a href="https://www.boost.org/sgi/stl/InputIterator.html" target="_top">InputIterator</a>. </p></td>
2081 <td><p><span class="term">Postconditions:</span></p></td>
2082 <td><p>Elements from the range <code class="computeroutput">[first + max[0, distance(first, last) - (pos - begin()) - reserve()], last)</code> will be inserted at the position <code class="computeroutput">pos</code>.<br>
2083 The number of <code class="computeroutput">min[pos - begin(), max[0, distance(first, last) - reserve()]]</code> elements will be overwritten at the beginning of the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code>.<br>
2084 (See <span class="emphasis"><em>Example</em></span> for the explanation.)<br>
2086 The amount of allocated memory in the internal buffer may be predictively increased. </p></td>
2089 <td><p><span class="term">Throws:</span></p></td>
2090 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T(const T&)</code> throws or nothing if <code class="computeroutput">T::T(T&&)</code> is noexcept. </td>
2095 <li class="listitem">
2096 <pre class="literallayout"><span class="identifier">iterator</span> <a name="idm45097335444752-bb"></a><span class="identifier">rinsert</span><span class="special">(</span><span class="identifier">iterator</span> pos<span class="special">,</span> <span class="identifier">param_value_type</span> item<span class="special">)</span><span class="special">;</span></pre>Insert an element before the specified position. <p>
2102 <p><b>Exception Safety. </b>Basic. </p>
2105 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
2108 <p><b>Complexity. </b>Linear (in the size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>). </p>
2111 <p><span class="bold"><strong>See Also:</strong></span></p>
2112 <p><code class="computeroutput">rinsert(iterator, size_type, value_type)</code>, <code class="computeroutput">rinsert(iterator, InputIterator, InputIterator)</code>, <code class="computeroutput">insert(iterator, value_type)</code>, <code class="computeroutput">insert(iterator, size_type, value_type)</code>, <code class="computeroutput">insert(iterator, InputIterator, InputIterator)</code> </p>
2117 <div class="variablelist"><table border="0" class="variablelist compact">
2119 <col align="left" valign="top">
2124 <td><p><span class="term">Parameters:</span></p></td>
2125 <td><div class="variablelist"><table border="0" class="variablelist compact">
2127 <col align="left" valign="top">
2132 <td><p><span class="term"><code class="computeroutput">item</code></span></p></td>
2133 <td><p>The element to be inserted. </p></td>
2136 <td><p><span class="term"><code class="computeroutput">pos</code></span></p></td>
2137 <td><p>An iterator specifying the position before which the <code class="computeroutput">item</code> will be inserted. </p></td>
2143 <td><p><span class="term">Requires:</span></p></td>
2144 <td><p><code class="computeroutput">pos</code> is a valid iterator pointing to the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> or its end. </p></td>
2147 <td><p><span class="term">Postconditions:</span></p></td>
2148 <td><p>The <code class="computeroutput">item</code> will be inserted before the position <code class="computeroutput">pos</code>.<br>
2149 If the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> is full, the last element will be overwritten. If the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> is full and the <code class="computeroutput">pos</code> points to <code class="computeroutput">end()</code>, then the <code class="computeroutput">item</code> will not be inserted. If the capacity is <code class="computeroutput">0</code>, nothing will be inserted.<br>
2151 The amount of allocated memory in the internal buffer may be predictively increased. </p></td>
2154 <td><p><span class="term">Returns:</span></p></td>
2155 <td><p>Iterator to the inserted element or <code class="computeroutput">end()</code> if the <code class="computeroutput">item</code> is not inserted. (See the <span class="emphasis"><em>Effect</em></span>.) </p></td>
2158 <td><p><span class="term">Throws:</span></p></td>
2159 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T(const T&)</code> throws. Whatever <code class="computeroutput">T::operator = (const T&)</code> throws. </td>
2164 <li class="listitem">
2165 <pre class="literallayout"><span class="identifier">iterator</span> <a name="idm45097335419744-bb"></a><span class="identifier">rinsert</span><span class="special">(</span><span class="identifier">iterator</span> pos<span class="special">,</span> <span class="identifier">rvalue_type</span> item<span class="special">)</span><span class="special">;</span></pre>Insert an element before the specified position. <p>
2171 <p><b>Exception Safety. </b>Basic. </p>
2174 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
2177 <p><b>Complexity. </b>Linear (in the size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>). </p>
2180 <p><span class="bold"><strong>See Also:</strong></span></p>
2181 <p><code class="computeroutput">rinsert(iterator, size_type, value_type)</code>, <code class="computeroutput">rinsert(iterator, InputIterator, InputIterator)</code>, <code class="computeroutput">insert(iterator, value_type)</code>, <code class="computeroutput">insert(iterator, size_type, value_type)</code>, <code class="computeroutput">insert(iterator, InputIterator, InputIterator)</code> </p>
2186 <div class="variablelist"><table border="0" class="variablelist compact">
2188 <col align="left" valign="top">
2193 <td><p><span class="term">Parameters:</span></p></td>
2194 <td><div class="variablelist"><table border="0" class="variablelist compact">
2196 <col align="left" valign="top">
2201 <td><p><span class="term"><code class="computeroutput">item</code></span></p></td>
2202 <td><p>The element to be inserted. </p></td>
2205 <td><p><span class="term"><code class="computeroutput">pos</code></span></p></td>
2206 <td><p>An iterator specifying the position before which the <code class="computeroutput">item</code> will be inserted. </p></td>
2212 <td><p><span class="term">Requires:</span></p></td>
2213 <td><p><code class="computeroutput">pos</code> is a valid iterator pointing to the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> or its end. </p></td>
2216 <td><p><span class="term">Postconditions:</span></p></td>
2217 <td><p>The <code class="computeroutput">item</code> will be inserted before the position <code class="computeroutput">pos</code>.<br>
2218 If the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> is full, the last element will be overwritten. If the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> is full and the <code class="computeroutput">pos</code> points to <code class="computeroutput">end()</code>, then the <code class="computeroutput">item</code> will not be inserted. If the capacity is <code class="computeroutput">0</code>, nothing will be inserted.<br>
2220 The amount of allocated memory in the internal buffer may be predictively increased. </p></td>
2223 <td><p><span class="term">Returns:</span></p></td>
2224 <td><p>Iterator to the inserted element or <code class="computeroutput">end()</code> if the <code class="computeroutput">item</code> is not inserted. (See the <span class="emphasis"><em>Effect</em></span>.) </p></td>
2227 <td><p><span class="term">Throws:</span></p></td>
2228 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T(const T&)</code> throws or nothing if <code class="computeroutput">T::T(T&&)</code> is noexcept. </td>
2233 <li class="listitem">
2234 <pre class="literallayout"><span class="identifier">iterator</span> <a name="idm45097335394752-bb"></a><span class="identifier">rinsert</span><span class="special">(</span><span class="identifier">iterator</span> pos<span class="special">)</span><span class="special">;</span></pre>Insert an element before the specified position. <p>
2240 <p><b>Exception Safety. </b>Basic. </p>
2243 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
2246 <p><b>Complexity. </b>Linear (in the size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>). </p>
2249 <p><span class="bold"><strong>See Also:</strong></span></p>
2250 <p><code class="computeroutput">rinsert(iterator, size_type, value_type)</code>, <code class="computeroutput">rinsert(iterator, InputIterator, InputIterator)</code>, <code class="computeroutput">insert(iterator, value_type)</code>, <code class="computeroutput">insert(iterator, size_type, value_type)</code>, <code class="computeroutput">insert(iterator, InputIterator, InputIterator)</code> </p>
2255 <div class="variablelist"><table border="0" class="variablelist compact">
2257 <col align="left" valign="top">
2262 <td><p><span class="term">Parameters:</span></p></td>
2263 <td><div class="variablelist"><table border="0" class="variablelist compact">
2265 <col align="left" valign="top">
2269 <td><p><span class="term"><code class="computeroutput">pos</code></span></p></td>
2270 <td><p>An iterator specifying the position before which the <code class="computeroutput">item</code> will be inserted. </p></td>
2275 <td><p><span class="term">Requires:</span></p></td>
2276 <td><p><code class="computeroutput">pos</code> is a valid iterator pointing to the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> or its end. </p></td>
2279 <td><p><span class="term">Postconditions:</span></p></td>
2280 <td><p>The <code class="computeroutput">item</code> will be inserted before the position <code class="computeroutput">pos</code>.<br>
2281 If the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> is full, the last element will be overwritten. If the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> is full and the <code class="computeroutput">pos</code> points to <code class="computeroutput">end()</code>, then the <code class="computeroutput">item</code> will not be inserted. If the capacity is <code class="computeroutput">0</code>, nothing will be inserted.<br>
2283 The amount of allocated memory in the internal buffer may be predictively increased. </p></td>
2286 <td><p><span class="term">Returns:</span></p></td>
2287 <td><p>Iterator to the inserted element or <code class="computeroutput">end()</code> if the <code class="computeroutput">item</code> is not inserted. (See the <span class="emphasis"><em>Effect</em></span>.) </p></td>
2290 <td><p><span class="term">Throws:</span></p></td>
2291 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T()</code> throws. Whatever <code class="computeroutput">T::T(const T&)</code> throws or nothing if <code class="computeroutput">T::T(T&&)</code> is noexcept. </td>
2296 <li class="listitem">
2297 <pre class="literallayout"><span class="keyword">void</span> <a name="idm45097335370432-bb"></a><span class="identifier">rinsert</span><span class="special">(</span><span class="identifier">iterator</span> pos<span class="special">,</span> <span class="identifier">size_type</span> n<span class="special">,</span> <span class="identifier">param_value_type</span> item<span class="special">)</span><span class="special">;</span></pre>Insert <code class="computeroutput">n</code> copies of the <code class="computeroutput">item</code> before the specified position. <p>
2302 <p><b>Exception Safety. </b>Basic. </p>
2305 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
2308 <p><b>Complexity. </b>Linear (in <code class="computeroutput">min[capacity().capacity(), size() + n]</code>). </p>
2311 <p><b>Example. </b>Consider a <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> with the capacity of 6 and the size of 4. Its internal buffer may look like the one below.<br>
2313 <code class="computeroutput">|1|2|3|4| | |</code><br>
2314 <code class="computeroutput">p ___^</code><br>
2316 After inserting 5 elements before the position <code class="computeroutput">p</code>:<br>
2318 <code class="computeroutput">rinsert(p, (size_t)5, 0);</code><br>
2320 actually only 4 elements get inserted and elements <code class="computeroutput">3</code> and <code class="computeroutput">4</code> are overwritten. This is due to the fact the rinsert operation preserves the capacity. After insertion the internal buffer looks like this:<br>
2322 <code class="computeroutput">|1|2|0|0|0|0|</code><br>
2324 For comparison if the capacity would not be preserved the internal buffer would then result in <code class="computeroutput">|1|2|0|0|0|0|0|3|4|</code>. </p>
2327 <p><span class="bold"><strong>See Also:</strong></span></p>
2328 <p><code class="computeroutput">rinsert(iterator, value_type)</code>, <code class="computeroutput">rinsert(iterator, InputIterator, InputIterator)</code>, <code class="computeroutput">insert(iterator, value_type)</code>, <code class="computeroutput">insert(iterator, size_type, value_type)</code>, <code class="computeroutput">insert(iterator, InputIterator, InputIterator)</code> </p>
2333 <div class="variablelist"><table border="0" class="variablelist compact">
2335 <col align="left" valign="top">
2340 <td><p><span class="term">Parameters:</span></p></td>
2341 <td><div class="variablelist"><table border="0" class="variablelist compact">
2343 <col align="left" valign="top">
2348 <td><p><span class="term"><code class="computeroutput">item</code></span></p></td>
2349 <td><p>The element whose copies will be inserted. </p></td>
2352 <td><p><span class="term"><code class="computeroutput">n</code></span></p></td>
2353 <td><p>The number of <code class="computeroutput">item</code>s the to be inserted. </p></td>
2356 <td><p><span class="term"><code class="computeroutput">pos</code></span></p></td>
2357 <td><p>An iterator specifying the position where the <code class="computeroutput">item</code>s will be inserted. </p></td>
2363 <td><p><span class="term">Requires:</span></p></td>
2364 <td><p><code class="computeroutput">pos</code> is a valid iterator pointing to the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> or its end. </p></td>
2367 <td><p><span class="term">Postconditions:</span></p></td>
2368 <td><p>The number of <code class="computeroutput">min[n, (end() - pos) + reserve()]</code> elements will be inserted before the position <code class="computeroutput">pos</code>.<br>
2369 The number of <code class="computeroutput">min[end() - pos, max[0, n - reserve()]]</code> elements will be overwritten at the end of the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code>.<br>
2370 (See <span class="emphasis"><em>Example</em></span> for the explanation.)<br>
2372 The amount of allocated memory in the internal buffer may be predictively increased. </p></td>
2375 <td><p><span class="term">Throws:</span></p></td>
2376 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T(const T&)</code> throws. Whatever <code class="computeroutput">T::operator = (const T&)</code> throws. </td>
2381 <li class="listitem">
2382 <pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">></span>
2383 <span class="keyword">void</span> <a name="idm45097335337904-bb"></a><span class="identifier">rinsert</span><span class="special">(</span><span class="identifier">iterator</span> pos<span class="special">,</span> <span class="identifier">InputIterator</span> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">)</span><span class="special">;</span></pre>Insert the range <code class="computeroutput">[first, last)</code> before the specified position. <p>
2388 <p><b>Exception Safety. </b>Basic. </p>
2391 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
2394 <p><b>Complexity. </b>Linear (in <code class="computeroutput">[size() + std::distance(first, last)]</code>; in <code class="computeroutput">min[capacity().capacity(), size() + std::distance(first, last)]</code> if the <code class="computeroutput">InputIterator</code> is a <a href="https://www.boost.org/sgi/stl/RandomAccessIterator.html" target="_top">RandomAccessIterator</a>). </p>
2397 <p><b>Example. </b>Consider a <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> with the capacity of 6 and the size of 4. Its internal buffer may look like the one below.<br>
2399 <code class="computeroutput">|1|2|3|4| | |</code><br>
2400 <code class="computeroutput">p ___^</code><br>
2402 After inserting a range of elements before the position <code class="computeroutput">p</code>:<br>
2404 <code class="computeroutput">int array[] = { 5, 6, 7, 8, 9 };</code><br>
2405 <code class="computeroutput">insert(p, array, array + 5);</code><br>
2407 actually only elements <code class="computeroutput">5</code>, <code class="computeroutput">6</code>, <code class="computeroutput">7</code> and <code class="computeroutput">8</code> from the specified range get inserted and elements <code class="computeroutput">3</code> and <code class="computeroutput">4</code> are overwritten. This is due to the fact the rinsert operation preserves the capacity. After insertion the internal buffer looks like this:<br>
2409 <code class="computeroutput">|1|2|5|6|7|8|</code><br>
2411 For comparison if the capacity would not be preserved the internal buffer would then result in <code class="computeroutput">|1|2|5|6|7|8|9|3|4|</code>. </p>
2414 <p><span class="bold"><strong>See Also:</strong></span></p>
2415 <p><code class="computeroutput">rinsert(iterator, value_type)</code>, <code class="computeroutput">rinsert(iterator, size_type, value_type)</code>, <code class="computeroutput">insert(iterator, value_type)</code>, <code class="computeroutput">insert(iterator, size_type, value_type)</code>, <code class="computeroutput">insert(iterator, InputIterator, InputIterator)</code> </p>
2420 <div class="variablelist"><table border="0" class="variablelist compact">
2422 <col align="left" valign="top">
2427 <td><p><span class="term">Parameters:</span></p></td>
2428 <td><div class="variablelist"><table border="0" class="variablelist compact">
2430 <col align="left" valign="top">
2435 <td><p><span class="term"><code class="computeroutput">first</code></span></p></td>
2436 <td><p>The beginning of the range to be inserted. </p></td>
2439 <td><p><span class="term"><code class="computeroutput">last</code></span></p></td>
2440 <td><p>The end of the range to be inserted. </p></td>
2443 <td><p><span class="term"><code class="computeroutput">pos</code></span></p></td>
2444 <td><p>An iterator specifying the position where the range will be inserted. </p></td>
2450 <td><p><span class="term">Requires:</span></p></td>
2451 <td><p><code class="computeroutput">pos</code> is a valid iterator pointing to the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> or its end.<br>
2452 Valid range <code class="computeroutput">[first, last)</code> where <code class="computeroutput">first</code> and <code class="computeroutput">last</code> meet the requirements of an <a href="https://www.boost.org/sgi/stl/InputIterator.html" target="_top">InputIterator</a>. </p></td>
2455 <td><p><span class="term">Postconditions:</span></p></td>
2456 <td><p>Elements from the range <code class="computeroutput">[first, last - max[0, distance(first, last) - (end() - pos) - reserve()])</code> will be inserted before the position <code class="computeroutput">pos</code>.<br>
2457 The number of <code class="computeroutput">min[end() - pos, max[0, distance(first, last) - reserve()]]</code> elements will be overwritten at the end of the <code class="computeroutput"><a class="link" href="circular_buffer.html" title="Class template circular_buffer">circular_buffer</a></code>.<br>
2458 (See <span class="emphasis"><em>Example</em></span> for the explanation.)<br>
2460 The amount of allocated memory in the internal buffer may be predictively increased. </p></td>
2463 <td><p><span class="term">Throws:</span></p></td>
2464 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::T(const T&)</code> throws. Whatever <code class="computeroutput">T::operator = (const T&)</code> throws. </td>
2469 <li class="listitem">
2470 <pre class="literallayout"><span class="identifier">iterator</span> <a name="idm45097335299280-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="identifier">iterator</span> pos<span class="special">)</span><span class="special">;</span></pre>Remove an element at the specified position. <p>
2476 <p><b>Exception Safety. </b>Basic. </p>
2479 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
2482 <p><b>Complexity. </b>Linear (in the size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>). </p>
2485 <p><span class="bold"><strong>See Also:</strong></span></p>
2486 <p><code class="computeroutput">erase(iterator, iterator)</code>, <code class="computeroutput">rerase(iterator)</code>, <code class="computeroutput">rerase(iterator, iterator)</code>, <code class="computeroutput">clear()</code> </p>
2491 <div class="variablelist"><table border="0" class="variablelist compact">
2493 <col align="left" valign="top">
2498 <td><p><span class="term">Parameters:</span></p></td>
2499 <td><div class="variablelist"><table border="0" class="variablelist compact">
2501 <col align="left" valign="top">
2505 <td><p><span class="term"><code class="computeroutput">pos</code></span></p></td>
2506 <td><p>An iterator pointing at the element to be removed. </p></td>
2511 <td><p><span class="term">Requires:</span></p></td>
2512 <td><p><code class="computeroutput">pos</code> is a valid iterator pointing to the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> (but not an <code class="computeroutput">end()</code>). </p></td>
2515 <td><p><span class="term">Postconditions:</span></p></td>
2516 <td><p>The element at the position <code class="computeroutput">pos</code> is removed.<br>
2518 The amount of allocated memory in the internal buffer may be predictively decreased. </p></td>
2521 <td><p><span class="term">Returns:</span></p></td>
2522 <td><p>Iterator to the first element remaining beyond the removed element or <code class="computeroutput">end()</code> if no such element exists. </p></td>
2525 <td><p><span class="term">Throws:</span></p></td>
2526 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::operator = (const T&)</code> throws or nothing if <code class="computeroutput">T::operator = (T&&)</code> is noexcept. </td>
2531 <li class="listitem">
2532 <pre class="literallayout"><span class="identifier">iterator</span> <a name="idm45097335281168-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="identifier">iterator</span> first<span class="special">,</span> <span class="identifier">iterator</span> last<span class="special">)</span><span class="special">;</span></pre>Erase the range <code class="computeroutput">[first, last)</code>. <p>
2538 <p><b>Exception Safety. </b>Basic. </p>
2541 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
2544 <p><b>Complexity. </b>Linear (in the size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>). </p>
2547 <p><span class="bold"><strong>See Also:</strong></span></p>
2548 <p><code class="computeroutput">erase(iterator)</code>, <code class="computeroutput">rerase(iterator)</code>, <code class="computeroutput">rerase(iterator, iterator)</code>, <code class="computeroutput">clear()</code> </p>
2553 <div class="variablelist"><table border="0" class="variablelist compact">
2555 <col align="left" valign="top">
2560 <td><p><span class="term">Parameters:</span></p></td>
2561 <td><div class="variablelist"><table border="0" class="variablelist compact">
2563 <col align="left" valign="top">
2568 <td><p><span class="term"><code class="computeroutput">first</code></span></p></td>
2569 <td><p>The beginning of the range to be removed. </p></td>
2572 <td><p><span class="term"><code class="computeroutput">last</code></span></p></td>
2573 <td><p>The end of the range to be removed. </p></td>
2579 <td><p><span class="term">Requires:</span></p></td>
2580 <td><p>Valid range <code class="computeroutput">[first, last)</code>. </p></td>
2583 <td><p><span class="term">Postconditions:</span></p></td>
2584 <td><p>The elements from the range <code class="computeroutput">[first, last)</code> are removed. (If <code class="computeroutput">first == last</code> nothing is removed.)<br>
2586 The amount of allocated memory in the internal buffer may be predictively decreased. </p></td>
2589 <td><p><span class="term">Returns:</span></p></td>
2590 <td><p>Iterator to the first element remaining beyond the removed elements or <code class="computeroutput">end()</code> if no such element exists. </p></td>
2593 <td><p><span class="term">Throws:</span></p></td>
2594 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::operator = (const T&)</code> throws or nothing if <code class="computeroutput">T::operator = (T&&)</code> is noexcept. </td>
2599 <li class="listitem">
2600 <pre class="literallayout"><span class="identifier">iterator</span> <a name="idm45097335262272-bb"></a><span class="identifier">rerase</span><span class="special">(</span><span class="identifier">iterator</span> pos<span class="special">)</span><span class="special">;</span></pre>Remove an element at the specified position. <p>
2606 <p><b>Exception Safety. </b>Basic. </p>
2609 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
2612 <p><b>Complexity. </b>Linear (in the size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>). </p>
2615 <div class="note"><table border="0" summary="Note">
2617 <td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../doc/src/images/note.png"></td>
2618 <th align="left">Note</th>
2620 <tr><td align="left" valign="top"><p>Basically there is no difference between <code class="computeroutput">erase(iterator)</code> and this method. It is implemented only for consistency with the base <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_buffer.html" title="Class template circular_buffer">circular_buffer</a></code></code>. </p></td></tr>
2624 <p><span class="bold"><strong>See Also:</strong></span></p>
2625 <p><code class="computeroutput">erase(iterator)</code>, <code class="computeroutput">erase(iterator, iterator)</code>, <code class="computeroutput">rerase(iterator, iterator)</code>, <code class="computeroutput">clear()</code> </p>
2630 <div class="variablelist"><table border="0" class="variablelist compact">
2632 <col align="left" valign="top">
2637 <td><p><span class="term">Parameters:</span></p></td>
2638 <td><div class="variablelist"><table border="0" class="variablelist compact">
2640 <col align="left" valign="top">
2644 <td><p><span class="term"><code class="computeroutput">pos</code></span></p></td>
2645 <td><p>An iterator pointing at the element to be removed. </p></td>
2650 <td><p><span class="term">Requires:</span></p></td>
2651 <td><p><code class="computeroutput">pos</code> is a valid iterator pointing to the <code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code> (but not an <code class="computeroutput">end()</code>).<br>
2653 The amount of allocated memory in the internal buffer may be predictively decreased. </p></td>
2656 <td><p><span class="term">Postconditions:</span></p></td>
2657 <td><p>The element at the position <code class="computeroutput">pos</code> is removed. </p></td>
2660 <td><p><span class="term">Returns:</span></p></td>
2661 <td><p>Iterator to the first element remaining in front of the removed element or <code class="computeroutput">begin()</code> if no such element exists. </p></td>
2664 <td><p><span class="term">Throws:</span></p></td>
2665 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::operator = (const T&)</code> throws or nothing if <code class="computeroutput">T::operator = (T&&)</code> is noexcept. </td>
2670 <li class="listitem">
2671 <pre class="literallayout"><span class="identifier">iterator</span> <a name="idm45097335242032-bb"></a><span class="identifier">rerase</span><span class="special">(</span><span class="identifier">iterator</span> first<span class="special">,</span> <span class="identifier">iterator</span> last<span class="special">)</span><span class="special">;</span></pre>Erase the range <code class="computeroutput">[first, last)</code>. <p>
2677 <p><b>Exception Safety. </b>Basic. </p>
2680 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
2683 <p><b>Complexity. </b>Linear (in the size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>). </p>
2686 <div class="note"><table border="0" summary="Note">
2688 <td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../doc/src/images/note.png"></td>
2689 <th align="left">Note</th>
2691 <tr><td align="left" valign="top"><p>Basically there is no difference between <code class="computeroutput">erase(iterator, iterator)</code> and this method. It is implemented only for consistency with the base <code class="computeroutput"><<code class="computeroutput"><a class="link" href="circular_buffer.html" title="Class template circular_buffer">circular_buffer</a></code></code>. </p></td></tr>
2695 <p><span class="bold"><strong>See Also:</strong></span></p>
2696 <p><code class="computeroutput">erase(iterator)</code>, <code class="computeroutput">erase(iterator, iterator)</code>, <code class="computeroutput">rerase(iterator)</code>, <code class="computeroutput">clear()</code> </p>
2701 <div class="variablelist"><table border="0" class="variablelist compact">
2703 <col align="left" valign="top">
2708 <td><p><span class="term">Parameters:</span></p></td>
2709 <td><div class="variablelist"><table border="0" class="variablelist compact">
2711 <col align="left" valign="top">
2716 <td><p><span class="term"><code class="computeroutput">first</code></span></p></td>
2717 <td><p>The beginning of the range to be removed. </p></td>
2720 <td><p><span class="term"><code class="computeroutput">last</code></span></p></td>
2721 <td><p>The end of the range to be removed. </p></td>
2727 <td><p><span class="term">Requires:</span></p></td>
2728 <td><p>Valid range <code class="computeroutput">[first, last)</code>. </p></td>
2731 <td><p><span class="term">Postconditions:</span></p></td>
2732 <td><p>The elements from the range <code class="computeroutput">[first, last)</code> are removed. (If <code class="computeroutput">first == last</code> nothing is removed.)<br>
2734 The amount of allocated memory in the internal buffer may be predictively decreased. </p></td>
2737 <td><p><span class="term">Returns:</span></p></td>
2738 <td><p>Iterator to the first element remaining in front of the removed elements or <code class="computeroutput">begin()</code> if no such element exists. </p></td>
2741 <td><p><span class="term">Throws:</span></p></td>
2742 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). Whatever <code class="computeroutput">T::operator = (const T&)</code> throws or nothing if <code class="computeroutput">T::operator = (T&&)</code> is noexcept. </td>
2747 <li class="listitem">
2748 <pre class="literallayout"><span class="keyword">void</span> <a name="idm45097335220832-bb"></a><span class="identifier">clear</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>Remove all stored elements from the space optimized circular buffer. <p>
2751 <p><b>Exception Safety. </b>Basic. </p>
2754 <p><b>Iterator Invalidation. </b>Invalidates all iterators pointing to the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code> (except iterators equal to <code class="computeroutput">end()</code>). </p>
2757 <p><b>Complexity. </b>Linear (in the size of the <code class="computeroutput"><code class="computeroutput"><a class="link" href="circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code></code>). </p>
2760 <p><span class="bold"><strong>See Also:</strong></span></p>
2761 <p><code class="computeroutput">~circular_buffer_space_optimized()</code>, <code class="computeroutput">erase(iterator)</code>, <code class="computeroutput">erase(iterator, iterator)</code>, <code class="computeroutput">rerase(iterator)</code>, <code class="computeroutput">rerase(iterator, iterator)</code> </p>
2766 <div class="variablelist"><table border="0" class="variablelist compact">
2768 <col align="left" valign="top">
2773 <td><p><span class="term">Postconditions:</span></p></td>
2774 <td><p><code class="computeroutput">size() == 0</code><br>
2776 The amount of allocated memory in the internal buffer may be predictively decreased. </p></td>
2779 <td><p><span class="term">Throws:</span></p></td>
2780 <td>An allocation error if memory is exhausted (<code class="computeroutput">std::bad_alloc</code> if the standard allocator is used). </td>
2789 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
2790 <td align="left"></td>
2791 <td align="right"><div class="copyright-footer">Copyright © 2003-2013 Jan Gaspar<p>
2792 Distributed under the Boost Software License, Version 1.0. (See accompanying
2793 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>)
2798 <div class="spirit-nav">
2799 <a accesskey="p" href="swap_idm45097335994640.html"><img src="../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../boost_circular_buffer_c___reference.html#header.boost.circular_buffer.space_optimized_hpp"><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="../circular_buffer/s14.html"><img src="../../../doc/src/images/next.png" alt="Next"></a>