12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130 |
- <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0.1 Transitional//EN">
- <html>
- <head>
- <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
- <title>Boost.MultiIndex Documentation - Random access indices reference</title>
- <link rel="stylesheet" href="../style.css" type="text/css">
- <link rel="start" href="../index.html">
- <link rel="prev" href="seq_indices.html">
- <link rel="up" href="index.html">
- <link rel="next" href="key_extraction.html">
- </head>
- <body>
- <h1><img src="../../../../boost.png" alt="boost.png (6897 bytes)" align=
- "middle" width="277" height="86">Boost.MultiIndex Random access indices reference</h1>
- <div class="prev_link"><a href="seq_indices.html"><img src="../prev.gif" alt="sequenced indices" border="0"><br>
- Sequenced indices
- </a></div>
- <div class="up_link"><a href="index.html"><img src="../up.gif" alt="Boost.MultiIndex reference" border="0"><br>
- Boost.MultiIndex reference
- </a></div>
- <div class="next_link"><a href="key_extraction.html"><img src="../next.gif" alt="key extraction" border="0"><br>
- Key extraction
- </a></div><br clear="all" style="clear: all;">
- <hr>
- <h2>Contents</h2>
- <ul>
- <li><a href="#rnd_index_fwd_synopsis">Header
- <code>"boost/multi_index/random_access_index_fwd.hpp"</code> synopsis</a></li>
- <li><a href="#synopsis">Header
- <code>"boost/multi_index/random_access_index.hpp"</code> synopsis</a>
- <ul>
- <li><a href="#random_access"><code>random_access</code> index specifier</a></li>
- <li><a href="#rnd_indices">Random access indices</a>
- <ul>
- <li><a href="#complexity_signature">Complexity signature</a></li>
- <li><a href="#instantiation_types">Instantiation types</a></li>
- <li><a href="#constructors">Constructors, copy and assignment</a></li>
- <li><a href="#iterators">Iterators</a></li>
- <li><a href="#capacity">Capacity operations</a></li>
- <li><a href="#modifiers">Modifiers</a></li>
- <li><a href="#list_operations">List operations</a></li>
- <li><a href="#rearrange_operations">Rearrange operations</a></li>
- <li><a href="#serialization">Serialization</a></li>
- </ul>
- </li>
- </ul>
- </li>
- </ul>
- <h2>
- <a name="rnd_index_fwd_synopsis">Header
- <a href="../../../../boost/multi_index/random_access_index_fwd.hpp">
- <code>"boost/multi_index/random_access_index_fwd.hpp"</code></a> synopsis</a></h2>
- <blockquote><pre>
- <span class=keyword>namespace</span> <span class=identifier>boost</span><span class=special>{</span>
- <span class=keyword>namespace</span> <span class=identifier>multi_index</span><span class=special>{</span>
- <span class=comment>// random_access index specifier</span>
- <span class=keyword>template</span><span class=special><</span><span class=keyword>typename</span> <span class=identifier>TagList</span><span class=special>=</span><span class=identifier>tag</span><span class=special><></span> <span class=special>></span> <span class=keyword>struct</span> <span class=identifier>random_access</span><span class=special>;</span>
- <span class=comment>// indices</span>
- <span class=keyword>namespace</span> <span class=identifier>detail</span><span class=special>{</span>
- <span class=keyword>template</span><span class=special><</span><b>implementation defined</b><span class=special>></span> <span class=keyword>class</span> <b>index class name implementation defined</b><span class=special>;</span>
- <span class=special>}</span> <span class=comment>// namespace boost::multi_index::detail</span>
- <span class=special>}</span> <span class=comment>// namespace boost::multi_index</span>
- <span class=special>}</span> <span class=comment>// namespace boost</span>
- </pre></blockquote>
- <p>
- <code>random_access_index_fwd.hpp</code> provides forward declarations for the
- <a href="#random_access"><code>random_access</code></a> index specifier and
- its associated <a href="#rnd_indices">random access index</a> class.
- </p>
- <h2>
- <a name="synopsis">Header
- <a href="../../../../boost/multi_index/random_access_index.hpp">
- <code>"boost/multi_index/random_access_index.hpp"</code></a> synopsis</a></h2>
- <blockquote><pre>
- <span class=preprocessor>#include</span> <span class=special><</span><span class=identifier>initializer_list</span><span class=special>></span>
- <span class=keyword>namespace</span> <span class=identifier>boost</span><span class=special>{</span>
- <span class=keyword>namespace</span> <span class=identifier>multi_index</span><span class=special>{</span>
- <span class=comment>// random_access index specifier</span>
- <span class=keyword>template</span><span class=special><</span><span class=keyword>typename</span> <span class=identifier>TagList</span><span class=special>=</span><span class=identifier>tag</span><span class=special><></span> <span class=special>></span> <span class=keyword>struct</span> <span class=identifier>random_access</span><span class=special>;</span>
- <span class=comment>// indices</span>
- <span class=keyword>namespace</span> <span class=identifier>detail</span><span class=special>{</span>
- <span class=keyword>template</span><span class=special><</span><b>implementation defined</b><span class=special>></span> <span class=keyword>class</span> <b>index class name implementation defined</b><span class=special>;</span>
- <span class=comment>// index comparison:</span>
- <span class=comment>// <b>OP</b> is any of ==,<,!=,>,>=,<=</span>
- <span class=keyword>template</span><span class=special><</span><b>arg set 1</b><span class=special>,</span><b>arg set 2</b><span class=special>></span>
- <span class=keyword>bool</span> <span class=keyword>operator</span> <b><i>OP</i></b><span class=special>(</span>
- <span class=keyword>const</span> <b>index class name</b><span class=special><</span><b>arg set 1</b><span class=special>>&</span> <span class=identifier>x</span><span class=special>,</span><span class=keyword>const</span> <b>index class name</b><span class=special><</span><b>arg set 2</b><span class=special>>&</span> <span class=identifier>y</span><span class=special>);</span>
- <span class=comment>// index specialized algorithms:</span>
- <span class=keyword>template</span><span class=special><</span><b>implementation defined</b><span class=special>></span>
- <span class=keyword>void</span> <span class=identifier>swap</span><span class=special>(</span><b>index class name</b><span class=special>&</span> <span class=identifier>x</span><span class=special>,</span><b>index class name</b><span class=special>&</span> <span class=identifier>y</span><span class=special>);</span>
- <span class=special>}</span> <span class=comment>// namespace boost::multi_index::detail</span>
- <span class=special>}</span> <span class=comment>// namespace boost::multi_index</span>
- <span class=special>}</span> <span class=comment>// namespace boost</span>
- </pre></blockquote>
- <h3><a name="random_access">
- <code>random_access</code> index specifier
- </a></h3>
- <p>
- This index specifier allows for insertion of a <a href="#rnd_indices">random
- access index</a>.</p>
- <blockquote><pre>
- <span class=keyword>template</span><span class=special><</span><span class=keyword>typename</span> <span class=identifier>TagList</span><span class=special>=</span><span class=identifier>tag</span><span class=special><></span> <span class=special>></span> <span class=keyword>struct</span> <span class=identifier>random_access</span><span class=special>;</span>
- </pre></blockquote>
- <p>If provided, <code>TagList</code> must be an instantiation of
- <a href="indices.html#tag"><code>tag</code></a>.
- </p>
- <h3><a name="rnd_indices">Random access indices</a></h3>
- <p>
- Random access indices are free-order sequences with constant time
- positional access and random access iterators. Elements in a
- random access index are by default sorted according to their order of
- insertion: this means that new elements inserted through a different index
- of the <code>multi_index_container</code> are appended to the end of the
- random access index; additionally, facilities are provided
- for further rearrangement of the elements. The public interface of
- random access indices includes that of
- <a href="seq_indices.html">sequenced indices</a>, with differences in
- the complexity of the operations, plus extra operations for
- positional access (<code>operator[]</code> and <code>at()</code>) and
- for capacity handling. Validity of iterators and references to elements
- is preserved in all operations, regardless of the capacity status.
- </p>
- <p>
- Except where noted or if the corresponding interface does not exist, random access
- indices verify the same container requirements as <code>std::vector</code>
- plus the requirements for <code>std::list</code> specific list operations at
- <b>[list.ops]</b>. Some of the most important differences with respect to
- <code>std::vector</code> are:
- <ul>
- <li>Random access indices do not provide memory contiguity, and hence do not
- have <code>data</code> member functions.
- </li>
- <li>The complexity of some operations, notably insertion and deletion, differ
- from those of <code>std::vector</code>.
- </li>
- <li>Unlike as in <code>std::vector</code>, insertions into a random access index
- may fail due to clashings with other indices. This alters the semantics
- of the operations provided with respect to their analogues in
- <code>std::vector</code>.
- </li>
- <li>Elements in a randon access index are not mutable, and can only be changed
- by means of <a href="#replace"><code>replace</code></a> and
- <a href="#modify"><code>modify</code></a> member functions.
- </li>
- <li><code>push_front</code> and <code>pop_front</code> are provided for
- compatibility with sequenced indices, even though they take linear time to execute.
- </li></ul>
- </p>
- <blockquote><pre>
- <span class=keyword>namespace</span> <span class=identifier>boost</span><span class=special>{</span>
- <span class=keyword>namespace</span> <span class=identifier>multi_index</span><span class=special>{</span>
- <span class=keyword>namespace</span> <span class=identifier>detail</span><span class=special>{</span>
- <span class=keyword>template</span><span class=special><</span><b>implementation defined: dependent on types Value, Allocator, TagList</b><span class=special>></span>
- <span class=keyword>class</span> <b>name is implementation defined</b>
- <span class=special>{</span>
- <span class=keyword>public</span><span class=special>:</span>
- <span class=comment>// types:</span>
- <span class=keyword>typedef</span> <span class=identifier>Value</span> <span class=identifier>value_type</span><span class=special>;</span>
- <span class=keyword>typedef</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>tuples</span><span class=special>::</span><span class=identifier>null_type</span> <span class=identifier>ctor_args</span><span class=special>;</span>
- <span class=keyword>typedef</span> <span class=identifier>TagList</span> <span class=identifier>tag_list</span><span class=special>;</span>
- <span class=keyword>typedef</span> <span class=identifier>Allocator</span> <span class=identifier>allocator_type</span><span class=special>;</span>
- <span class=keyword>typedef</span> <span class=keyword>typename</span> <span class=identifier>allocator_type</span><span class=special>::</span><span class=identifier>reference</span> <span class=identifier>reference</span><span class=special>;</span>
- <span class=keyword>typedef</span> <span class=keyword>typename</span> <span class=identifier>allocator_type</span><span class=special>::</span><span class=identifier>const_reference</span> <span class=identifier>const_reference</span><span class=special>;</span>
- <span class=keyword>typedef</span> <b>implementation defined</b> <span class=identifier>iterator</span><span class=special>;</span>
- <span class=keyword>typedef</span> <b>implementation defined</b> <span class=identifier>const_iterator</span><span class=special>;</span>
- <span class=keyword>typedef</span> <b>implementation defined</b> <span class=identifier>size_type</span><span class=special>;</span>
- <span class=keyword>typedef</span> <b>implementation defined</b> <span class=identifier>difference_type</span><span class=special>;</span>
- <span class=keyword>typedef</span> <span class=keyword>typename</span> <span class=identifier>allocator_type</span><span class=special>::</span><span class=identifier>pointer</span> <span class=identifier>pointer</span><span class=special>;</span>
- <span class=keyword>typedef</span> <span class=keyword>typename</span> <span class=identifier>allocator_type</span><span class=special>::</span><span class=identifier>const_pointer</span> <span class=identifier>const_pointer</span><span class=special>;</span>
- <span class=keyword>typedef</span> <b>equivalent to
- std::reverse_iterator<iterator></b> <span class=identifier>reverse_iterator</span><span class=special>;</span>
- <span class=keyword>typedef</span> <b>equivalent to
- std::reverse_iterator<const_iterator></b> <span class=identifier>const_reverse_iterator</span><span class=special>;</span>
- <span class=comment>// construct/copy/destroy:</span>
- <b>index class name</b><span class=special>&</span> <span class=keyword>operator</span><span class=special>=(</span><span class=keyword>const</span> <b>index class name</b><span class=special>&</span> <span class=identifier>x</span><span class=special>);</span>
- <b>index class name</b><span class=special>&</span> <span class=keyword>operator</span><span class=special>=(</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>initializer_list</span><span class=special><</span><span class=identifier>value_type</span><span class=special>></span> <span class=identifier>list</span><span class=special>);</span>
- <span class=keyword>template</span> <span class=special><</span><span class=keyword>class</span> <span class=identifier>InputIterator</span><span class=special>></span>
- <span class=keyword>void</span> <span class=identifier>assign</span><span class=special>(</span><span class=identifier>InputIterator</span> <span class=identifier>first</span><span class=special>,</span><span class=identifier>InputIterator</span> <span class=identifier>last</span><span class=special>);</span>
- <span class=keyword>void</span> <span class=identifier>assign</span><span class=special>(</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>initializer_list</span><span class=special><</span><span class=identifier>value_type</span><span class=special>></span> <span class=identifier>list</span><span class=special>)</span>
- <span class=keyword>void</span> <span class=identifier>assign</span><span class=special>(</span><span class=identifier>size_type</span> <span class=identifier>n</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&</span> <span class=identifier>value</span><span class=special>);</span>
-
- <span class=identifier>allocator_type</span> <span class=identifier>get_allocator</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
- <span class=comment>// iterators:</span>
- <span class=identifier>iterator</span> <span class=identifier>begin</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
- <span class=identifier>const_iterator</span> <span class=identifier>begin</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
- <span class=identifier>iterator</span> <span class=identifier>end</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
- <span class=identifier>const_iterator</span> <span class=identifier>end</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
- <span class=identifier>reverse_iterator</span> <span class=identifier>rbegin</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
- <span class=identifier>const_reverse_iterator</span> <span class=identifier>rbegin</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
- <span class=identifier>reverse_iterator</span> <span class=identifier>rend</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
- <span class=identifier>const_reverse_iterator</span> <span class=identifier>rend</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
- <span class=identifier>const_iterator</span> <span class=identifier>cbegin</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
- <span class=identifier>const_iterator</span> <span class=identifier>cend</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
- <span class=identifier>const_reverse_iterator</span> <span class=identifier>crbegin</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
- <span class=identifier>const_reverse_iterator</span> <span class=identifier>crend</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
- <span class=identifier>iterator</span> <span class=identifier>iterator_to</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&</span> <span class=identifier>x</span><span class=special>);</span>
- <span class=identifier>const_iterator</span> <span class=identifier>iterator_to</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&</span> <span class=identifier>x</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
- <span class=comment>// capacity:</span>
- <span class=keyword>bool</span> <span class=identifier>empty</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
- <span class=identifier>size_type</span> <span class=identifier>size</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
- <span class=identifier>size_type</span> <span class=identifier>max_size</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
- <span class=identifier>size_type</span> <span class=identifier>capacity</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
- <span class=keyword>void</span> <span class=identifier>reserve</span><span class=special>(</span><span class=identifier>size_type</span> <span class=identifier>m</span><span class=special>);</span>
- <span class=keyword>void</span> <span class=identifier>shrink_to_fit</span><span class=special>();</span>
- <span class=keyword>void</span> <span class=identifier>resize</span><span class=special>(</span><span class=identifier>size_type</span> <span class=identifier>n</span><span class=special>);</span>
- <span class=keyword>void</span> <span class=identifier>resize</span><span class=special>(</span><span class=identifier>size_type</span> <span class=identifier>n</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&</span> <span class=identifier>x</span><span class=special>);</span>
- <span class=comment>// access:</span>
- <span class=identifier>const_reference</span> <span class=keyword>operator</span><span class=special>[](</span><span class=identifier>size_type</span> <span class=identifier>n</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
- <span class=identifier>const_reference</span> <span class=identifier>at</span><span class=special>(</span><span class=identifier>size_type</span> <span class=identifier>n</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
- <span class=identifier>const_reference</span> <span class=identifier>front</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
- <span class=identifier>const_reference</span> <span class=identifier>back</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
- <span class=comment>// modifiers:</span>
- <span class=keyword>template</span><span class=special><</span><span class=keyword>typename</span><span class=special>...</span> <span class=identifier>Args</span><span class=special>></span>
- <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special><</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>></span> <span class=identifier>emplace_front</span><span class=special>(</span><span class=identifier>Args</span><span class=special>&&...</span> <span class=identifier>args</span><span class=special>);</span>
- <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special><</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>></span> <span class=identifier>push_front</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&</span> <span class=identifier>x</span><span class=special>);</span>
- <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special><</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>></span> <span class=identifier>push_front</span><span class=special>(</span><span class=identifier>value_type</span><span class=special>&&</span> <span class=identifier>x</span><span class=special>);</span>
- <span class=keyword>void</span> <span class=identifier>pop_front</span><span class=special>();</span>
- <span class=keyword>template</span><span class=special><</span><span class=keyword>typename</span><span class=special>...</span> <span class=identifier>Args</span><span class=special>></span>
- <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special><</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>></span> <span class=identifier>emplace_back</span><span class=special>(</span><span class=identifier>Args</span><span class=special>&&...</span> <span class=identifier>args</span><span class=special>);</span>
- <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special><</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>></span> <span class=identifier>push_back</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&</span> <span class=identifier>x</span><span class=special>);</span>
- <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special><</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>></span> <span class=identifier>push_back</span><span class=special>(</span><span class=identifier>value_type</span><span class=special>&&</span> <span class=identifier>x</span><span class=special>);</span>
- <span class=keyword>void</span> <span class=identifier>pop_back</span><span class=special>();</span>
- <span class=keyword>template</span><span class=special><</span><span class=keyword>typename</span><span class=special>...</span> <span class=identifier>Args</span><span class=special>></span>
- <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special><</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>></span> <span class=identifier>emplace</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>Args</span><span class=special>&&...</span> <span class=identifier>args</span><span class=special>);</span>
- <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special><</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>></span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&</span> <span class=identifier>x</span><span class=special>);</span>
- <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special><</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>></span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>value_type</span><span class=special>&&</span> <span class=identifier>x</span><span class=special>);</span>
- <span class=keyword>void</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>size_type</span> <span class=identifier>m</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&</span> <span class=identifier>x</span><span class=special>);</span>
- <span class=keyword>template</span><span class=special><</span><span class=keyword>typename</span> <span class=identifier>InputIterator</span><span class=special>></span>
- <span class=keyword>void</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>InputIterator</span> <span class=identifier>first</span><span class=special>,</span><span class=identifier>InputIterator</span> <span class=identifier>last</span><span class=special>);</span>
- <span class=keyword>void</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>initializer_list</span><span class=special><</span><span class=identifier>value_type</span><span class=special>></span> <span class=identifier>list</span><span class=special>);</span>
- <span class=identifier>iterator</span> <span class=identifier>erase</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>);</span>
- <span class=identifier>iterator</span> <span class=identifier>erase</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>first</span><span class=special>,</span><span class=identifier>iterator</span> <span class=identifier>last</span><span class=special>);</span>
- <span class=keyword>bool</span> <span class=identifier>replace</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&</span> <span class=identifier>x</span><span class=special>);</span>
- <span class=keyword>bool</span> <span class=identifier>replace</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>value_type</span><span class=special>&&</span> <span class=identifier>x</span><span class=special>);</span>
- <span class=keyword>template</span><span class=special><</span><span class=keyword>typename</span> <span class=identifier>Modifier</span><span class=special>></span> <span class=keyword>bool</span> <span class=identifier>modify</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>Modifier</span> <span class=identifier>mod</span><span class=special>);</span>
- <span class=keyword>template</span><span class=special><</span><span class=keyword>typename</span> <span class=identifier>Modifier</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>Rollback</span><span class=special>></span>
- <span class=keyword>bool</span> <span class=identifier>modify</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>Modifier</span> <span class=identifier>mod</span><span class=special>,</span><span class=identifier>Rollback</span> <span class=identifier>back</span><span class=special>);</span>
- <span class=keyword>void</span> <span class=identifier>swap</span><span class=special>(</span><b>index class name</b><span class=special>&</span> <span class=identifier>x</span><span class=special>);</span>
- <span class=keyword>void</span> <span class=identifier>clear</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
- <span class=comment>// list operations:</span>
- <span class=keyword>void</span> <span class=identifier>splice</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><b>index class name</b><span class=special>&</span> <span class=identifier>x</span><span class=special>);</span>
- <span class=keyword>void</span> <span class=identifier>splice</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><b>index class name</b><span class=special>&</span> <span class=identifier>x</span><span class=special>,</span><span class=identifier>iterator</span> <span class=identifier>i</span><span class=special>);</span>
- <span class=keyword>void</span> <span class=identifier>splice</span><span class=special>(</span>
- <span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><b>index class name</b><span class=special>&</span> <span class=identifier>x</span><span class=special>,</span><span class=identifier>iterator</span> <span class=identifier>first</span><span class=special>,</span><span class=identifier>iterator</span> <span class=identifier>last</span><span class=special>);</span>
- <span class=keyword>void</span> <span class=identifier>remove</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&</span> <span class=identifier>value</span><span class=special>);</span>
- <span class=keyword>template</span><span class=special><</span><span class=keyword>typename</span> <span class=identifier>Predicate</span><span class=special>></span> <span class=keyword>void</span> <span class=identifier>remove_if</span><span class=special>(</span><span class=identifier>Predicate</span> <span class=identifier>pred</span><span class=special>);</span>
- <span class=keyword>void</span> <span class=identifier>unique</span><span class=special>();</span>
- <span class=keyword>template</span> <span class=special><</span><span class=keyword>class</span> <span class=identifier>BinaryPredicate</span><span class=special>></span>
- <span class=keyword>void</span> <span class=identifier>unique</span><span class=special>(</span><span class=identifier>BinaryPredicate</span> <span class=identifier>binary_pred</span><span class=special>);</span>
- <span class=keyword>void</span> <span class=identifier>merge</span><span class=special>(</span><b>index class name</b><span class=special>&</span> <span class=identifier>x</span><span class=special>);</span>
- <span class=keyword>template</span> <span class=special><</span><span class=keyword>typename</span> <span class=identifier>Compare</span><span class=special>></span> <span class=keyword>void</span> <span class=identifier>merge</span><span class=special>(</span><b>index class name</b><span class=special>&</span> <span class=identifier>x</span><span class=special>,</span><span class=identifier>Compare</span> <span class=identifier>comp</span><span class=special>);</span>
- <span class=keyword>void</span> <span class=identifier>sort</span><span class=special>();</span>
- <span class=keyword>template</span> <span class=special><</span><span class=keyword>typename</span> <span class=identifier>Compare</span><span class=special>></span> <span class=keyword>void</span> <span class=identifier>sort</span><span class=special>(</span><span class=identifier>Compare</span> <span class=identifier>comp</span><span class=special>);</span>
- <span class=keyword>void</span> <span class=identifier>reverse</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
- <span class=comment>// rearrange operations:</span>
- <span class=keyword>void</span> <span class=identifier>relocate</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>iterator</span> <span class=identifier>i</span><span class=special>);</span>
- <span class=keyword>void</span> <span class=identifier>relocate</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>iterator</span> <span class=identifier>first</span><span class=special>,</span><span class=identifier>iterator</span> <span class=identifier>last</span><span class=special>);</span>
- <span class=keyword>template</span><span class=special><</span><span class=keyword>typename</span> <span class=identifier>InputIterator</span><span class=special>></span> <span class=keyword>void</span> <span class=identifier>rearrange</span><span class=special>(</span><span class=identifier>InputIterator</span> <span class=identifier>first</span><span class=special>);</span>
- <span class=special>}</span>
- <span class=comment>// index comparison:</span>
- <span class=keyword>template</span><span class=special><</span><b>arg set 1</b><span class=special>,</span><b>arg set 2</b><span class=special>></span>
- <span class=keyword>bool</span> <span class=keyword>operator</span><span class=special>==(</span>
- <span class=keyword>const</span> <b>index class name</b><span class=special><</span><b>arg set 1</b><span class=special>>&</span> <span class=identifier>x</span><span class=special>,</span>
- <span class=keyword>const</span> <b>index class name</b><span class=special><</span><b>arg set 2</b><span class=special>>&</span> <span class=identifier>y</span><span class=special>)</span>
- <span class=special>{</span>
- <span class=keyword>return</span> <span class=identifier>x</span><span class=special>.</span><span class=identifier>size</span><span class=special>()==</span><span class=identifier>y</span><span class=special>.</span><span class=identifier>size</span><span class=special>()&&</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>equal</span><span class=special>(</span><span class=identifier>x</span><span class=special>.</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>x</span><span class=special>.</span><span class=identifier>end</span><span class=special>(),</span><span class=identifier>y</span><span class=special>.</span><span class=identifier>begin</span><span class=special>());</span>
- <span class=special>}</span>
- <span class=keyword>template</span><span class=special><</span><b>arg set 1</b><span class=special>,</span><b>arg set 2</b><span class=special>></span>
- <span class=keyword>bool</span> <span class=keyword>operator</span><span class=special><(</span>
- <span class=keyword>const</span> <b>index class name</b><span class=special><</span><b>arg set 1</b><span class=special>>&</span> <span class=identifier>x</span><span class=special>,</span>
- <span class=keyword>const</span> <b>index class name</b><span class=special><</span><b>arg set 2</b><span class=special>>&</span> <span class=identifier>y</span><span class=special>)</span>
- <span class=special>{</span>
- <span class=keyword>return</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>lexicographical_compare</span><span class=special>(</span><span class=identifier>x</span><span class=special>.</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>x</span><span class=special>.</span><span class=identifier>end</span><span class=special>(),</span><span class=identifier>y</span><span class=special>.</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>y</span><span class=special>.</span><span class=identifier>end</span><span class=special>());</span>
- <span class=special>}</span>
- <span class=keyword>template</span><span class=special><</span><b>arg set 1</b><span class=special>,</span><b>arg set 2</b><span class=special>></span>
- <span class=keyword>bool</span> <span class=keyword>operator</span><span class=special>!=(</span>
- <span class=keyword>const</span> <b>index class name</b><span class=special><</span><b>arg set 1</b><span class=special>>&</span> <span class=identifier>x</span><span class=special>,</span>
- <span class=keyword>const</span> <b>index class name</b><span class=special><</span><b>arg set 2</b><span class=special>>&</span> <span class=identifier>y</span><span class=special>)</span>
- <span class=special>{</span>
- <span class=keyword>return</span> <span class=special>!(</span><span class=identifier>x</span><span class=special>==</span><span class=identifier>y</span><span class=special>);</span>
- <span class=special>}</span>
- <span class=keyword>template</span><span class=special><</span><b>arg set 1</b><span class=special>,</span><b>arg set 2</b><span class=special>></span>
- <span class=keyword>bool</span> <span class=keyword>operator</span><span class=special>>(</span>
- <span class=keyword>const</span> <b>index class name</b><span class=special><</span><b>arg set 1</b><span class=special>>&</span> <span class=identifier>x</span>
- <span class=special>,</span><span class=keyword>const</span> <b>index class name</b><span class=special><</span><b>arg set 2</b><span class=special>>&</span> <span class=identifier>y</span><span class=special>)</span>
- <span class=special>{</span>
- <span class=keyword>return</span> <span class=identifier>y</span><span class=special><</span><span class=identifier>x</span><span class=special>;</span>
- <span class=special>}</span>
- <span class=keyword>template</span><span class=special><</span><b>arg set 1</b><span class=special>,</span><b>arg set 2</b><span class=special>></span>
- <span class=keyword>bool</span> <span class=keyword>operator</span><span class=special>>=(</span>
- <span class=keyword>const</span> <b>index class name</b><span class=special><</span><b>arg set 1</b><span class=special>>&</span> <span class=identifier>x</span><span class=special>,</span>
- <span class=keyword>const</span> <b>index class name</b><span class=special><</span><b>arg set 2</b><span class=special>>&</span> <span class=identifier>y</span><span class=special>)</span>
- <span class=special>{</span>
- <span class=keyword>return</span> <span class=special>!(</span><span class=identifier>x</span><span class=special><</span><span class=identifier>y</span><span class=special>);</span>
- <span class=special>}</span>
- <span class=keyword>template</span><span class=special><</span><b>arg set 1</b><span class=special>,</span><b>arg set 2</b><span class=special>></span>
- <span class=keyword>bool</span> <span class=keyword>operator</span><span class=special><=(</span>
- <span class=keyword>const</span> <b>index class name</b><span class=special><</span><b>arg set 1</b><span class=special>>&</span> <span class=identifier>x</span><span class=special>,</span>
- <span class=keyword>const</span> <b>index class name</b><span class=special><</span><b>arg set 2</b><span class=special>>&</span> <span class=identifier>y</span><span class=special>)</span>
- <span class=special>{</span>
- <span class=keyword>return</span> <span class=special>!(</span><span class=identifier>x</span><span class=special>></span><span class=identifier>y</span><span class=special>);</span>
- <span class=special>}</span>
- <span class=comment>// index specialized algorithms:</span>
- <span class=keyword>template</span><span class=special><</span><b>implementation defined</b><span class=special>></span>
- <span class=keyword>void</span> <span class=identifier>swap</span><span class=special>(</span><b>index class name</b><span class=special>&</span> <span class=identifier>x</span><span class=special>,</span><b>index class name</b><span class=special>&</span> <span class=identifier>y</span><span class=special>);</span>
- <span class=special>}</span> <span class=comment>// namespace boost::multi_index::detail</span>
- <span class=special>}</span> <span class=comment>// namespace boost::multi_index</span>
- <span class=special>}</span> <span class=comment>// namespace boost</span>
- </pre></blockquote>
- <h4><a name="complexity_signature">Complexity signature</a></h4>
- <p>
- Here and in the descriptions of operations of random access indices, we
- adopt the scheme outlined in the
- <a href="indices.html#complexity_signature">complexity signature
- section</a>. The complexity signature of random access indices is:
- <ul>
- <li>copying: <code>c(n)=n*log(n)</code>,</li>
- <li>insertion: <code>i(n)=1</code> (amortized constant),</li>
- <li>hinted insertion: <code>h(n)=1</code> (amortized constant),</li>
- <li>deletion: <code>d(n)=m</code>, where <code>m</code> is the distance
- from the deleted element to the end of the sequence,</li>
- <li>replacement: <code>r(n)=1</code> (constant),</li>
- <li>modifying: <code>m(n)=1</code> (constant).</li>
- </ul>
- The following expressions are also used as a convenience for writing down some
- of the complexity formulas:
- </p>
- <blockquote>
- <code>shl(a,b)</code> = <code>a+b</code> if a is nonzero, <code>0</code> otherwise.<br>
- <code>rel(a,b,c)</code> = if <code>a<b</code>, <code>c-a</code>, else <code>a-b</code>,
- </blockquote>
- <p>
- (<code>shl</code> and <code>rel</code> stand for <i>shift left</i> and
- <i>relocate</i>, respectively.)
- </p>
- <h4><a name="instantiation_types">Instantiation types</a></h4>
- <p>Random access indices are instantiated internally to <code>multi_index_container</code>
- and specified by means of <a href="indices.html#indexed_by">
- <code>indexed_by</code></a> with the <a href="#random_access"><code>random_access</code></a>
- index specifier. Instantiations are dependent on the following types:
- <ul>
- <li><code>Value</code> from <code>multi_index_container</code>,</li>
- <li><code>Allocator</code> from <code>multi_index_container</code>,</li>
- <li><code>TagList</code> from the index specifier (if provided, otherwise <code>tag<></code> is assumed).</li>
- </ul>
- <code>TagList</code> must be an instantiation of
- <a href="indices.html#tag"><code>tag</code></a>.
- </p>
- <h4><a name="constructors">Constructors, copy and assignment</a></h4>
- <p>
- As explained in the <a href="indices.html#index_concepts">index
- concepts section</a>, indices do not have public constructors or destructors.
- Assignment, on the other hand, is provided.
- </p>
- <code><b>index class name</b>& operator=(const <b>index class name</b>& x);</code>
- <blockquote>
- <b>Effects:</b>
- <blockquote><pre>
- <span class=identifier>a</span><span class=special>=</span><span class=identifier>b</span><span class=special>;</span>
- </pre></blockquote>
- where <code>a</code> and <code>b</code> are the <code>multi_index_container</code>
- objects to which <code>*this</code> and <code>x</code> belong, respectively.<br>
- <b>Returns:</b> <code>*this</code>.<br>
- </blockquote>
- <code><b>index class name</b>& operator=(std::initializer_list<value_type> list);</code>
- <blockquote>
- <b>Effects:</b>
- <blockquote><pre>
- <span class=identifier>a</span><span class=special>=</span><span class=identifier>list</span><span class=special>;</span>
- </pre></blockquote>
- where <code>a</code> is the <code>multi_index_container</code>
- object to which <code>*this</code> belongs.<br>
- <b>Returns:</b> <code>*this</code>.<br>
- </blockquote>
- <code>template <class InputIterator><br>
- void assign(InputIterator first,InputIterator last);</code>
- <blockquote>
- <b>Effects:</b>
- <blockquote><pre>
- <span class=identifier>clear</span><span class=special>();</span>
- <span class=identifier>insert</span><span class=special>(</span><span class=identifier>end</span><span class=special>(),</span><span class=identifier>first</span><span class=special>,</span><span class=identifier>last</span><span class=special>);</span>
- </pre></blockquote>
- </blockquote>
- <code>void assign(std::initializer_list<value_type> list);</code>
- <blockquote>
- <b>Effects:</b>
- <blockquote><pre>
- <span class=identifier>assign</span><span class=special>(</span><span class=identifier>list</span><span class=special>.</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>list</span><span class=special>.</span><span class=identifier>end</span><span class=special>());</span>
- </pre></blockquote>
- </blockquote>
-
- <code>void assign(size_type n,const value_type& value);</code>
- <blockquote>
- <b>Effects:</b>
- <blockquote><pre>
- <span class=identifier>clear</span><span class=special>();</span>
- <span class=keyword>for</span><span class=special>(</span><span class=identifier>size_type</span> <span class=identifier>i</span><span class=special>=</span><span class=number>0</span><span class=special>;</span><span class=identifier>i</span><span class=special><</span><span class=identifier>n</span><span class=special>;++</span><span class=identifier>n</span><span class=special>)</span><span class=identifier>push_back</span><span class=special>(</span><span class=identifier>v</span><span class=special>);</span>
- </pre></blockquote>
- </blockquote>
- <h4><a name="iterators">Iterators</a></h4>
- <code>iterator iterator_to(const value_type& x);<br>
- const_iterator iterator_to(const value_type& x)const;</code>
-
- <blockquote>
- <b>Requires:</b> <code>x</code> is a reference to an element of the container.<br>
- <b>Returns:</b> An iterator to <code>x</code>.<br>
- <b>Complexity:</b> Constant.<br>
- <b>Exception safety:</b> <code>nothrow</code>.<br>
- </blockquote>
- <h4><a name="capacity">Capacity operations</a></h4>
- <a name="capacity_memfun"><code>size_type capacity()const noexcept;</code></a>
- <blockquote>
- <b>Returns:</b> The total number of elements <code>c</code> such that, when
- <code>size()<c</code>, back insertions happen in constant time (the
- general case as described by
- <a href="#complexity_signature"><code>i(n)</code></a> is <i>amortized</i>
- constant time.)<br>
- <b>Note:</b> Validity of iterators and references to elements
- is preserved in all insertions, regardless of the capacity status.
- </blockquote>
- <a name="reserve"><code>void reserve(size_type m);</code></a>
- <blockquote>
- <b>Effects:</b> If the previous value of <code>capacity()</code>
- was greater than or equal to <code>m</code>, nothing is done;
- otherwise, the internal capacity is changed so that
- <code>capacity()>=m</code>.<br>
- <b>Complexity:</b> If the capacity is not changed, constant;
- otherwise <code>O(n)</code>.<br>
- <b>Exception safety:</b> If the capacity is not changed, <code>nothrow</code>;
- otherwise, strong.<br>
- </blockquote>
- <code>void shrink_to_fit();</code>
- <blockquote>
- <b>Effects:</b> Reduces <code>capacity()</code> to <code>size()</code>.<br>
- <b>Complexity:</b> If the capacity is not changed, constant;
- otherwise <code>O(n)</code>.<br>
- <b>Exception safety:</b> If the capacity is not changed, <code>nothrow</code>;
- otherwise, strong.<br>
- </blockquote>
- <code>void resize(size_type n);<br>
- void resize(size_type n,const value_type& x);</code>
- <blockquote>
- <b>Requires (first version):</b> <code>value_type</code> is <code>DefaultInsertable</code>
- into <code>multi_index_container</code>.<br>
- <b>Requires (second version):</b> <code>value_type</code> is <code>CopyInsertable</code>
- into <code>multi_index_container</code>.<br>
- <b>Effects:</b> If <code>size()<n</code>, tries to append <code>n-size()</code> default-inserted
- elements (first version) or copies of <code>x</code> (second version) at the end of
- the index. If <code>n<size()</code>, erases the last <code>size()-n</code> elements.<br>
- <b>Note:</b> If an expansion is requested, the size of the index is not guaranteed
- to be <code>n</code> after this operation (other indices may ban insertions.)
- </blockquote>
- <h4><a name="modifiers">Modifiers</a></h4>
- <code>template<typename... Args><br>
- std::pair<iterator,bool> emplace_front(Args&&... args);</code>
- <blockquote>
- <b>Effects:</b>
- <blockquote><pre>
- <span class=identifier>emplace</span><span class=special>(</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>forward</span><span class=special><</span><span class=identifier>Args</span><span class=special>>(</span><span class=identifier>args</span><span class=special>)...);</span>
- </pre></blockquote>
- <b>Returns:</b> The return value is a pair <code>p</code>. <code>p.second</code>
- is <code>true</code> if and only if insertion took place. On successful
- insertion, <code>p.first</code> points to the element inserted; otherwise,
- <code>p.first</code> points to an element that caused the insertion to be banned.
- Note that more than one element can be causing insertion not to be allowed.<br>
- </blockquote>
- <code>std::pair<iterator,bool> push_front(const value_type& x);</code><br>
- <code>std::pair<iterator,bool> push_front(value_type&& x);</code>
- <blockquote>
- <b>Effects:</b>
- <blockquote><pre>
- <span class=identifier>insert</span><span class=special>(</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>x</span><span class=special>);</span> <span class=comment>// lvalue ref version</span>
- <span class=identifier>insert</span><span class=special>(</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>move</span><span class=special>(</span><span class=identifier>x</span><span class=special>));</span> <span class=comment>// rvalue ref version</span>
- </pre></blockquote>
- <b>Returns:</b> The return value is a pair <code>p</code>. <code>p.second</code>
- is <code>true</code> if and only if insertion took place. On successful
- insertion, <code>p.first</code> points to the element inserted; otherwise,
- <code>p.first</code> points to an element that caused the insertion to be banned.
- Note that more than one element can be causing insertion not to be allowed.<br>
- </blockquote>
- <code>template<typename... Args><br>
- std::pair<iterator,bool> emplace_back(Args&&... args);</code>
- <blockquote>
- <b>Effects:</b>
- <blockquote><pre>
- <span class=identifier>emplace</span><span class=special>(</span><span class=identifier>end</span><span class=special>(),</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>forward</span><span class=special><</span><span class=identifier>Args</span><span class=special>>(</span><span class=identifier>args</span><span class=special>)...);</span>
- </pre></blockquote>
- <b>Returns:</b> The return value is a pair <code>p</code>. <code>p.second</code>
- is <code>true</code> if and only if insertion took place. On successful
- insertion, <code>p.first</code> points to the element inserted; otherwise,
- <code>p.first</code> points to an element that caused the insertion to be banned.
- Note that more than one element can be causing insertion not to be allowed.<br>
- </blockquote>
- <code>std::pair<iterator,bool> push_back(const value_type& x);</code><br>
- <code>std::pair<iterator,bool> push_back(value_type&& x);</code>
- <blockquote>
- <b>Effects:</b>
- <blockquote><pre>
- <span class=identifier>insert</span><span class=special>(</span><span class=identifier>end</span><span class=special>(),</span><span class=identifier>x</span><span class=special>);</span> <span class=comment>// lvalue ref version</span>
- <span class=identifier>insert</span><span class=special>(</span><span class=identifier>end</span><span class=special>(),</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>move</span><span class=special>(</span><span class=identifier>x</span><span class=special>));</span> <span class=comment>// rvalue ref version</span>
- </pre></blockquote>
- <b>Returns:</b> The return value is a pair <code>p</code>. <code>p.second</code>
- is <code>true</code> if and only if insertion took place. On successful
- insertion, <code>p.first</code> points to the element inserted; otherwise,
- <code>p.first</code> points to an element that caused the insertion to be banned.
- Note that more than one element can be causing insertion not to be allowed.<br>
- </blockquote>
- <code>template<typename... Args><br>
- std::pair<iterator,bool> emplace(iterator position,Args&&... args);</code>
- <blockquote>
- <b>Requires:</b> <code>value_type</code> is <code>EmplaceConstructible</code>
- into <code>multi_index_container</code> from <code>args</code>.<br>
- <b>Effects:</b> Inserts a <code>value_type</code> object constructed with
- <code>std::forward<Args>(args)...</code> before <code>position</code> if insertion
- is allowed by all other indices of the <code>multi_index_container</code>.<br>
- <b>Returns:</b> The return value is a pair <code>p</code>. <code>p.second</code>
- is <code>true</code> if and only if insertion took place. On successful insertion,
- <code>p.first</code> points to the element inserted; otherwise, <code>p.first</code>
- points to an element that caused the insertion to be banned. Note that more than
- one element can be causing insertion not to be allowed.<br>
- <b>Complexity:</b> <code>O(I(n))</code>.<br>
- <b>Exception safety:</b> Strong.<br>
- </blockquote>
- <code>std::pair<iterator,bool> insert(iterator position,const value_type& x);</code><br>
- <code>std::pair<iterator,bool> insert(iterator position,value_type&& x);</code>
- <blockquote>
- <b>Requires (first version):</b> <code>value_type</code> is <code>CopyInsertable</code>
- into <code>multi_index_container</code>.
- <code>position</code> is a valid iterator of the index.<br>
- <b>Requires (second version):</b> <code>value_type</code> is <code>MoveInsertable</code>
- into <code>multi_index_container</code>.
- <code>position</code> is a valid iterator of the index.<br>
- <b>Effects:</b> Inserts <code>x</code> before <code>position</code> if insertion
- is allowed by all other indices of the <code>multi_index_container</code>.<br>
- <b>Returns:</b> The return value is a pair <code>p</code>. <code>p.second</code>
- is <code>true</code> if and only if insertion took place. On successful
- insertion, <code>p.first</code> points to the element inserted; otherwise,
- <code>p.first</code> points to an element that caused the insertion to be banned.
- Note that more than one element can be causing insertion not to be allowed.<br>
- <b>Complexity:</b> <code>O(I(n))</code>.<br>
- <b>Exception safety:</b> Strong.
- </blockquote>
- <code>void insert(iterator position,size_type m,const value_type& x);</code>
- <blockquote>
- <b>Requires:</b> <code>position</code> is a valid iterator of the index.<br>
- <b>Effects:</b>
- <blockquote><pre>
- <span class=keyword>for</span><span class=special>(</span><span class=identifier>size_type</span> <span class=identifier>i</span><span class=special>=</span><span class=number>0</span><span class=special>;</span><span class=identifier>i</span><span class=special><</span><span class=identifier>m</span><span class=special>;++</span><span class=identifier>i</span><span class=special>)</span><span class=identifier>insert</span><span class=special>(</span><span class=identifier>position</span><span class=special>,</span><span class=identifier>x</span><span class=special>);</span>
- </pre></blockquote>
- <b>Complexity:</b> <code>O(shl(end()-position,m) + m*I(n+m))</code>.
- </blockquote>
- <code>template<typename InputIterator><br>
- void insert(iterator position,InputIterator first,InputIterator last);</code>
- <blockquote>
- <b>Requires:</b> <code>position</code> is a valid iterator of the index.
- <code>InputIterator</code> is an input iterator.
- <code>value_type</code> is
- <code>EmplaceConstructible</code> into
- <code>multi_index_container</code> from <code>*first</code>.
- <code>first</code> and <code>last</code> are not iterators into any
- index of the <code>multi_index_container</code> to which this index belongs.
- <code>last</code> is reachable from <code>first</code>.<br>
- <b>Effects:</b>
- For each element of [<code>first</code>, <code>last</code>), in this
- order, inserts it before <code>position</code> if insertion is allowed by all
- other indices of the <code>multi_index_container</code>.<br>
- <b>Complexity:</b> <code>O(shl(end()-position,m) + m*I(n+m))</code>,
- where <code>m</code> is the number of elements in
- [<code>first</code>,<code>last</code>).<br>
- <b>Exception safety:</b> Basic.
- </blockquote>
- <code>void insert(iterator position,std::initializer_list<value_type> list);</code>
- <blockquote>
- <b>Effects:</b>
- <blockquote><pre>
- <span class=identifier>insert</span><span class=special>(</span><span class=identifier>position</span><span class=special>,</span><span class=identifier>list</span><span class=special>.</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>list</span><span class=special>.</span><span class=identifier>end</span><span class=special>());</span>
- </pre></blockquote>
- </blockquote>
-
- <code>iterator erase(iterator position);</code>
- <blockquote>
- <b>Requires:</b> <code>position</code> is a valid dereferenceable iterator
- of the index.<br>
- <b>Effects:</b> Deletes the element pointed to by <code>position</code>.<br>
- <b>Returns:</b> An iterator pointing to the element immediately following
- the one that was deleted, or <code>end()</code>
- if no such element exists.<br>
- <b>Complexity:</b> <code>O(D(n))</code>.<br>
- <b>Exception safety:</b> <code>nothrow</code>.<br>
- </blockquote>
- <code>iterator erase(iterator first,iterator last);</code>
- <blockquote>
- <b>Requires:</b> [<code>first</code>,<code>last</code>) is a valid
- range of the index.<br>
- <b>Effects:</b> Deletes the elements in [<code>first</code>,<code>last</code>).<br>
- <b>Returns:</b> <code>last</code>.<br>
- <b>Complexity:</b> <code>O(m*D(n))</code>, where <code>m</code> is
- the number of elements in [<code>first</code>,<code>last</code>).<br>
- <b>Exception safety:</b> <code>nothrow</code>.<br>
- </blockquote>
- <a name="replace"><code>bool replace(iterator position,const value_type& x);</code></a><br>
- <code>bool replace(iterator position,value_type&& x);</code>
- <blockquote>
- <b>Requires (first version):</b> <code>value_type</code> is <code>CopyAssignable</code>.
- <code>position</code> is a valid dereferenceable iterator of the index.<br>
- <b>Requires (second version):</b> <code>value_type</code> is <code>MoveAssignable</code>.
- <code>position</code> is a valid dereferenceable iterator of the index.<br>
- <b>Effects:</b> Assigns the value <code>x</code> to the element pointed
- to by <code>position</code> into the <code>multi_index_container</code> to which
- the index belongs if replacing is allowed by all other indices of the
- <code>multi_index_container</code>.<br>
- <b>Postconditions:</b> Validity of <code>position</code> is preserved
- in all cases.<br>
- <b>Returns:</b> <code>true</code> if the replacement took place,
- <code>false</code> otherwise.<br>
- <b>Complexity:</b> <code>O(R(n))</code>.<br>
- <b>Exception safety:</b> Strong. If an exception is thrown by some
- user-provided operation the <code>multi_index_container</code> to which the index
- belongs remains in its original state.
- </blockquote>
-
- <a name="modify">
- <code>template<typename Modifier> bool modify(iterator position,Modifier mod);</code></a>
- <blockquote>
- <b>Requires:</b> <code>mod</code> is a unary function object
- accepting arguments of type
- <code>value_type&</code>. <code>position</code> is a valid dereferenceable
- iterator of the index.
- The execution of <code>mod(e)</code>, where <code>e</code> is the element
- pointed to by <code>position</code>, does not invoke any operation of the
- <code>multi_index_container</code> after <code>e</code> is directly modified
- or, before modification, if the operation would invalidate <code>position</code>.<br>
- <b>Effects:</b> Calls <code>mod(e)</code> where <code>e</code> is the element
- pointed to by <code>position</code> and rearranges <code>*position</code> into
- all the indices of the <code>multi_index_container</code>. Rearrangement on sequenced
- indices does not change the position of the element with respect to the index;
- rearrangement on other indices may or might not succeed. If the rearrangement
- fails, the element is erased.<br>
- <b>Postconditions:</b> Validity of <code>position</code> is preserved if the
- operation succeeds.<br>
- <b>Returns:</b> <code>true</code> if the operation succeeded, <code>false</code>
- otherwise.<br>
- <b>Complexity:</b> <code>O(M(n))</code>.<br>
- <b>Exception safety:</b> Basic. If an exception is thrown by some
- user-provided operation (including <code>mod</code>), then
- the element pointed to by <code>position</code> is erased.
- </blockquote>
- <code>template<typename Modifier,typename Rollback><br>
- bool modify(iterator position,Modifier mod,Rollback back);</code>
- <blockquote>
- <b>Requires:</b> <code>mod</code> and <code>back</code> are unary function
- objects accepting arguments of type
- <code>value_type&</code>. <code>position</code> is a valid dereferenceable
- iterator of the index.
- The execution of <code>mod(e)</code>, where <code>e</code> is the element
- pointed to by <code>position</code>, does not invoke any operation of the
- <code>multi_index_container</code> after <code>e</code> is directly modified
- or, before modification, if the operation would invalidate <code>position</code>.
- <code>back(e)</code> does not invoke any operation of the
- <code>multi_index_container</code>.<br>
- <b>Effects:</b> Calls <code>mod(e)</code> where <code>e</code> is the element
- pointed to by <code>position</code> and tries to rearrange <code>*position</code> into
- all the indices of the <code>multi_index_container</code>. Rearrangement on sequenced
- indices does not change the position of the element with respect to the index;
- rearrangement on other indices may or might not succeed.
- If the rearrangement fails, <code>back(e)</code> is invoked: if the resulting value
- of <code>e</code> is consistent with its original position and constraints in all
- indices, the element is kept, otherwise it is erased.<br>
- <b>Postconditions:</b> Validity of <code>position</code> is preserved except if
- the element is erased under the conditions described below.<br>
- <b>Returns:</b> <code>true</code> if the operation succeeded, <code>false</code>
- otherwise.<br>
- <b>Complexity:</b> <code>O(M(n))</code>.<br>
- <b>Exception safety:</b> Strong, except if <code>mod</code> or <code>back</code> throw an
- exception or <code>back(e)</code> fails to properly restore the element or there is
- a throwing user-provided operation after invoking <code>back(e)</code>, in which cases
- the modified element is erased. If <code>back</code>
- throws inside the handling code executing after some other user-provided
- operation has thrown, it is the exception generated by <code>back</code> that
- is rethrown.
- </blockquote>
- <h4><a name="list_operations">List operations</a></h4>
- <p>
- Random access indices replicate the interface of sequenced indices, which
- in turn includes the list operations provided by <code>std::list</code>.
- The syntax and behavior of these operations exactly matches those
- of sequenced indices, but the associated complexity bounds differ in general.
- </p>
- <code>void splice(iterator position,<b>index class name</b>& x);</code>
- <blockquote>
- <b>Requires:</b> <code>position</code> is a valid iterator of the index.
- <code>&x!=this</code>.<br>
- <b>Effects:</b> Inserts the contents of <code>x</code> before <code>position</code>,
- in the same order as they were in <code>x</code>. Those elements successfully
- inserted are erased from <code>x</code>.<br>
- <b>Complexity:</b> <code>O(shl(end()-position,x.size()) + x.size()*I(n+x.size()) + x.size()*D(x.size()))</code>.<br>
- <b>Exception safety:</b> Basic.<br>
- </blockquote>
- <code>void splice(iterator position,<b>index class name</b>& x,iterator i);</code>
- <blockquote>
- <b>Requires:</b> <code>position</code> is a valid iterator of the index.
- <code>i</code> is a valid dereferenceable iterator <code>x</code>.<br>
- <b>Effects:</b> Inserts the element pointed to by <code>i</code> before
- <code>position</code>: if insertion is successful, the element is erased from
- <code>x</code>. In the special case <code>&x==this</code>, no copy or
- deletion is performed, and the operation is always successful. If
- <code>position==i</code>, no operation is performed.<br>
- <b>Postconditions:</b> If <code>&x==this</code>, no iterator or reference
- is invalidated.<br>
- <b>Complexity:</b> If <code>&x==this</code>, <code>O(rel(position,i,i+1))</code>;
- otherwise <code>O(shl(end()-position,1) + I(n) + D(n))</code>.<br>
- <b>Exception safety:</b> If <code>&x==this</code>, <code>nothrow</code>;
- otherwise, strong.<br>
- </blockquote>
- <code>void splice(iterator position,<b>index class name&</b> x,iterator first,iterator last);</code>
- <blockquote>
- <b>Requires:</b> <code>position</code> is a valid iterator of the index.
- <code>first</code> and <code>last</code> are valid iterators of <code>x</code>.
- <code>last</code> is reachable from <code>first</code>. <code>position</code>
- is not in the range [<code>first</code>,<code>last</code>).<br>
- <b>Effects:</b> For each element in the range [<code>first</code>,<code>last</code>),
- insertion is tried before <code>position</code>; if the operation is successful,
- the element is erased from <code>x</code>. In the special case
- <code>&x==this</code>, no copy or deletion is performed, and insertions are
- always successful.<br>
- <b>Postconditions:</b> If <code>&x==this</code>, no iterator or reference
- is invalidated.<br>
- <b>Complexity:</b> If <code>&x==this</code>,
- <code>O(rel(position,first,last))</code>; otherwise
- <code>O(shl(end()-position,m) + m*I(n+m) + m*D(x.size()))</code>
- where <code>m</code> is the number of elements in [<code>first</code>,<code>last</code>).<br>
- <b>Exception safety:</b> If <code>&x==this</code>, <code>nothrow</code>;
- otherwise, basic.<br>
- </blockquote>
- <code>void remove(const value_type& value);</code>
- <blockquote>
- <b>Effects:</b> Erases all elements of the index which compare equal to
- <code>value</code>.<br>
- <b>Complexity:</b> <code>O(n + m*D(n))</code>, where <code>m</code>
- is the number of elements erased.<br>
- <b>Exception safety:</b> Basic.
- </blockquote>
-
- <code>template<typename Predicate> void remove_if(Predicate pred);</code>
- <blockquote>
- <b>Effects:</b> Erases all elements <code>x</code> of the index for which
- <code>pred(x)</code> holds.<br>
- <b>Complexity:</b> <code>O(n + m*D(n))</code>, where <code>m</code>
- is the number of elements erased.<br>
- <b>Exception safety:</b> Basic.
- </blockquote>
- <code>void unique();</code>
- <blockquote>
- <b>Effects:</b> Eliminates all but the first element from every consecutive
- group of equal elements referred to by the iterator <code>i</code> in the range
- [<code>first+1</code>,<code>last</code>) for which <code>*i==*(i-1)</code>.<br>
- <b>Complexity:</b> <code>O(n + m*D(n))</code>, where <code>m</code>
- is the number of elements erased.<br>
- <b>Exception safety:</b> Basic.
- </blockquote>
- <code>template <class BinaryPredicate> void unique(BinaryPredicate binary_pred);</code>
- <blockquote>
- <b>Effects:</b> Eliminates all but the first element from every consecutive
- group of elements referred to by the iterator <code>i</code> in the range
- [<code>first+1</code>,<code>last</code>) for which
- <code>binary_pred(*i,*(i-1))</code> holds.<br>
- <b>Complexity:</b> <code>O(n + m*D(n))</code>, where <code>m</code>
- is the number of elements erased.<br>
- <b>Exception safety:</b> Basic.
- </blockquote>
- <code>void merge(index class name& x);</code>
- <blockquote>
- <b>Requires:</b> <code>std::less<value_type></code> induces a
- strict weak ordering over <code>value_type</code>.
- Both the index and <code>x</code> are sorted according to
- <code>std::less<value_type></code>.<br>
- <b>Effects:</b> Attempts to insert every element of <code>x</code> into the
- corresponding position of the index (according to the order). Elements
- successfully inserted are erased from <code>x</code>. The resulting sequence
- is stable, i.e. equivalent elements of either container preserve their
- relative position. In the special case <code>&x==this</code>, no operation
- is performed.<br>
- <b>Postconditions:</b> Elements in the index and remaining elements in
- <code>x</code> are sorted.
- Validity of iterators to the index and of non-erased elements of <code>x</code>
- references is preserved.<br>
- <b>Complexity:</b> If <code>&x==this</code>, constant; otherwise
- <code>O(n + x.size()*I(n+x.size()) + x.size()*D(x.size()))</code>.<br>
- <b>Exception safety:</b> If <code>&x==this</code>, <code>nothrow</code>;
- otherwise, basic.<br>
- </blockquote>
-
- <code>template <typename Compare> void merge(index class name& x,Compare comp);</code>
- <blockquote>
- <b>Requires:</b> <code>Compare</code> induces a
- strict weak ordering over <code>value_type</code>.
- Both the index and <code>x</code> are sorted according to <code>comp</code>.<br>
- <b>Effects:</b> Attempts to insert every element of <code>x</code> into the
- corresponding position of the index (according to <code>comp</code>).
- Elements successfully inserted are erased from <code>x</code>. The resulting
- sequence is stable, i.e. equivalent elements of either container preserve
- their relative position. In the special case <code>&x==this</code>, no
- operation is performed.<br>
- <b>Postconditions:</b> Elements in the index and remaining elements in
- <code>x</code> are sorted according to <code>comp</code>.
- Validity of iterators to the index and of non-erased elements of <code>x</code>
- references is preserved.<br>
- <b>Complexity:</b> If <code>&x==this</code>, constant; otherwise
- <code>O(n + x.size()*I(n+x.size()) + x.size()*D(x.size()))</code>.<br>
- <b>Exception safety:</b> If <code>&x==this</code>, <code>nothrow</code>;
- otherwise, basic.<br>
- </blockquote>
- <code>void sort();</code>
- <blockquote>
- <b>Requires:</b> <code>std::less<value_type></code> induces a
- strict weark ordering over <code>value_type</code>.<br>
- <b>Effects:</b> Sorts the index according to
- <code>std::less<value_type></code>. The sorting is stable, i.e.
- equivalent elements preserve their relative position.<br>
- <b>Postconditions:</b> Validity of iterators and references is preserved.<br>
- <b>Complexity:</b> <code>O(n*log(n))</code>.<br>
- <b>Exception safety:</b> Basic.
- </blockquote>
- <code>template <typename Compare> void sort(Compare comp);</code>
- <blockquote>
- <b>Requires:</b> <code>Compare</code> induces a
- strict weak ordering over <code>value_type</code>.<br>
- <b>Effects:</b> Sorts the index according to <code>comp</code>. The sorting
- is stable, i.e. equivalent elements preserve their relative position.<br>
- <b>Postconditions:</b> Validity of iterators and references is preserved.<br>
- <b>Complexity:</b> <code>O(n*log(n))</code>.<br>
- <b>Exception safety:</b> Basic.
- </blockquote>
- <code>void reverse()noexcept;</code>
- <blockquote>
- <b>Effects:</b> Reverses the order of the elements in the index.<br>
- <b>Postconditions:</b> Validity of iterators and references is preserved.<br>
- <b>Complexity:</b> <code>O(n)</code>.<br>
- </blockquote>
- <h4><a name="rearrange_operations">Rearrange operations</a></h4>
- <p>
- These operations, without counterpart in STL sequence containers
- (although <code>std::list::splice</code> provides partially overlapping
- functionality), perform individual and global repositioning of elements
- inside the index.
- </p>
- <code>void relocate(iterator position,iterator i);</code>
- <blockquote>
- <b>Requires:</b> <code>position</code> is a valid iterator of the index.
- <code>i</code> is a valid dereferenceable iterator of the index.<br>
- <b>Effects:</b> Inserts the element pointed to by <code>i</code> before
- <code>position</code>. If <code>position==i</code>, no operation is
- performed.<br>
- <b>Postconditions:</b> No iterator or reference is invalidated.<br>
- <b>Complexity:</b> <code>O(rel(position,i,i+1))</code>.<br>
- <b>Exception safety:</b> <code>nothrow</code>.<br>
- </blockquote>
- <code>void relocate(iterator position,iterator first,iterator last);</code>
- <blockquote>
- <b>Requires:</b> <code>position</code> is a valid iterator of the index.
- <code>first</code> and <code>last</code> are valid iterators of the index.
- <code>last</code> is reachable from <code>first</code>. <code>position</code>
- is not in the range [<code>first</code>,<code>last</code>).<br>
- <b>Effects:</b> The range of elements [<code>first</code>,<code>last</code>)
- is repositioned just before <code>position</code>.<br>
- <b>Postconditions:</b> No iterator or reference is invalidated.<br>
- <b>Complexity:</b> <code>O(rel(position,first,last))</code>.<br>
- <b>Exception safety:</b> <code>nothrow</code>.<br>
- </blockquote>
- <a name="rearrange"><code>template<typename InputIterator> void rearrange(InputIterator first);</code></a>
- <blockquote>
- <b>Requires:</b> The range [<code>first</code>,
- <code>std::advance(first,n)</code>),
- where <code>n</code> is the size of the index, is a
- <a href="indices.html#views">free view</a> of the index.<br>
- <b>Effects:</b> The elements are rearranged so as to match the
- order of the previously described view.<br>
- <b>Postconditions:</b> No iterator or reference is invalidated.<br>
- <b>Complexity:</b> <code>O(n)</code>.<br>
- <b>Exception safety:</b> Basic.<br>
- </blockquote>
- <h4><a name="serialization">Serialization</a></h4>
- <p>
- Indices cannot be serialized on their own, but only as part of the
- <code>multi_index_container</code> into which they are embedded. In describing
- the additional preconditions and guarantees associated to random access indices
- with respect to serialization of their embedding containers, we
- use the concepts defined in the <code>multi_index_container</code>
- <a href="multi_index_container.html#serialization">serialization section</a>.
- </p>
- Operation: saving of a <code>multi_index_container</code> <code>m</code> to an
- output archive (XML archive) <code>ar</code>.
- <blockquote>
- <b>Requires:</b> No additional requirements to those imposed by the container.
- </blockquote>
- Operation: loading of a <code>multi_index_container</code> <code>m'</code> from an
- input archive (XML archive) <code>ar</code>.
- <blockquote>
- <b>Requires:</b> No additional requirements to those imposed by the container.<br>
- <b>Postconditions:</b> On successful loading, each of the elements of
- [<code>begin()</code>, <code>end()</code>) is a restored copy of the corresponding
- element in [<code>m.get<i>().begin()</code>, <code>m.get<i>().end()</code>),
- where <code>i</code> is the position of the random access index in the container.
- </blockquote>
- Operation: saving of an <code>iterator</code> or <code>const_iterator</code>
- <code>it</code> to an output archive (XML archive) <code>ar</code>.
- <blockquote>
- <b>Requires:</b> <code>it</code> is a valid iterator of the index. The associated
- <code>multi_index_container</code> has been previously saved.
- </blockquote>
- Operation: loading of an <code>iterator</code> or <code>const_iterator</code>
- <code>it'</code> from an input archive (XML archive) <code>ar</code>.
- <blockquote>
- <b>Postconditions:</b> On successful loading, if <code>it</code> was dereferenceable
- then <code>*it'</code> is the restored copy of <code>*it</code>, otherwise
- <code>it'==end()</code>.<br>
- <b>Note:</b> It is allowed that <code>it</code> be a <code>const_iterator</code>
- and the restored <code>it'</code> an <code>iterator</code>, or viceversa.
- </blockquote>
- <hr>
- <div class="prev_link"><a href="seq_indices.html"><img src="../prev.gif" alt="sequenced indices" border="0"><br>
- Sequenced indices
- </a></div>
- <div class="up_link"><a href="index.html"><img src="../up.gif" alt="Boost.MultiIndex reference" border="0"><br>
- Boost.MultiIndex reference
- </a></div>
- <div class="next_link"><a href="key_extraction.html"><img src="../next.gif" alt="key extraction" border="0"><br>
- Key extraction
- </a></div><br clear="all" style="clear: all;">
- <br>
- <p>Revised December 29th 2018</p>
- <p>© Copyright 2003-2018 Joaquín M López Muñoz.
- Distributed under the Boost Software
- License, Version 1.0. (See accompanying file <a href="../../../../LICENSE_1_0.txt">
- LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
- http://www.boost.org/LICENSE_1_0.txt</a>)
- </p>
- </body>
- </html>
|