1<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> 2<html> 3<head> 4<meta http-equiv="Content-Type" content="text/html; charset=UTF-8"> 5<title>Class template linear_slist_algorithms</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="../../intrusive/reference.html#header.boost.intrusive.linear_slist_algorithms_hpp" title="Header <boost/intrusive/linear_slist_algorithms.hpp>"> 10<link rel="prev" href="make_hashtable.html" title="Struct template make_hashtable"> 11<link rel="next" href="link_mode_type.html" title="Type link_mode_type"> 12</head> 13<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> 14<table cellpadding="2" width="100%"><tr> 15<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td> 16<td align="center"><a href="../../../../index.html">Home</a></td> 17<td align="center"><a href="../../../../libs/libraries.htm">Libraries</a></td> 18<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> 19<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> 20<td align="center"><a href="../../../../more/index.htm">More</a></td> 21</tr></table> 22<hr> 23<div class="spirit-nav"> 24<a accesskey="p" href="make_hashtable.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../intrusive/reference.html#header.boost.intrusive.linear_slist_algorithms_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="link_mode_type.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a> 25</div> 26<div class="refentry"> 27<a name="boost.intrusive.linear_slist_algorithms"></a><div class="titlepage"></div> 28<div class="refnamediv"> 29<h2><span class="refentrytitle">Class template linear_slist_algorithms</span></h2> 30<p>boost::intrusive::linear_slist_algorithms</p> 31</div> 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="../../intrusive/reference.html#header.boost.intrusive.linear_slist_algorithms_hpp" title="Header <boost/intrusive/linear_slist_algorithms.hpp>">boost/intrusive/linear_slist_algorithms.hpp</a>> 34 35</span><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> NodeTraits<span class="special">></span> 36<span class="keyword">class</span> <a class="link" href="linear_slist_algorithms.html" title="Class template linear_slist_algorithms">linear_slist_algorithms</a> <span class="special">{</span> 37<span class="keyword">public</span><span class="special">:</span> 38 <span class="comment">// types</span> 39 <span class="keyword">typedef</span> <span class="identifier">NodeTraits</span><span class="special">::</span><span class="identifier">node</span> <a name="boost.intrusive.linear_slist_algorithms.node"></a><span class="identifier">node</span><span class="special">;</span> 40 <span class="keyword">typedef</span> <span class="identifier">NodeTraits</span><span class="special">::</span><span class="identifier">node_ptr</span> <a name="boost.intrusive.linear_slist_algorithms.node_ptr"></a><span class="identifier">node_ptr</span><span class="special">;</span> 41 <span class="keyword">typedef</span> <span class="identifier">NodeTraits</span><span class="special">::</span><span class="identifier">const_node_ptr</span> <a name="boost.intrusive.linear_slist_algorithms.const_node_ptr"></a><span class="identifier">const_node_ptr</span><span class="special">;</span> 42 <span class="keyword">typedef</span> <span class="identifier">NodeTraits</span> <a name="boost.intrusive.linear_slist_algorithms.node_traits"></a><span class="identifier">node_traits</span><span class="special">;</span> 43 44 <span class="comment">// <a class="link" href="linear_slist_algorithms.html#idm45020922208320-bb">public static functions</a></span> 45 <span class="keyword">static</span> <span class="keyword">void</span> <a class="link" href="linear_slist_algorithms.html#idm45020922207760-bb"><span class="identifier">init</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">node_ptr</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span> 46 <span class="keyword">static</span> <span class="keyword">bool</span> <a class="link" href="linear_slist_algorithms.html#idm45020922202896-bb"><span class="identifier">unique</span></a><span class="special">(</span><span class="identifier">const_node_ptr</span><span class="special">)</span><span class="special">;</span> 47 <span class="keyword">static</span> <span class="keyword">bool</span> <a class="link" href="linear_slist_algorithms.html#idm45020922197072-bb"><span class="identifier">inited</span></a><span class="special">(</span><span class="identifier">const_node_ptr</span><span class="special">)</span><span class="special">;</span> 48 <span class="keyword">static</span> <span class="keyword">void</span> <a class="link" href="linear_slist_algorithms.html#idm45020922192512-bb"><span class="identifier">unlink_after</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">node_ptr</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span> 49 <span class="keyword">static</span> <span class="keyword">void</span> <a class="link" href="linear_slist_algorithms.html#idm45020922187088-bb"><span class="identifier">unlink_after</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">node_ptr</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">node_ptr</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span> 50 <span class="keyword">static</span> <span class="keyword">void</span> <a class="link" href="linear_slist_algorithms.html#idm45020922180960-bb"><span class="identifier">link_after</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">node_ptr</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">node_ptr</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span> 51 <span class="keyword">static</span> <span class="keyword">void</span> <a class="link" href="linear_slist_algorithms.html#idm45020922174880-bb"><span class="identifier">transfer_after</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">node_ptr</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">node_ptr</span> <span class="special">&</span><span class="special">,</span> 52 <span class="keyword">const</span> <span class="identifier">node_ptr</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span> 53 <span class="keyword">static</span> <span class="keyword">void</span> <a class="link" href="linear_slist_algorithms.html#idm45020922167984-bb"><span class="identifier">init_header</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">node_ptr</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span> 54 <span class="keyword">static</span> <span class="identifier">node_ptr</span> <a class="link" href="linear_slist_algorithms.html#idm45020922162960-bb"><span class="identifier">get_previous_node</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">node_ptr</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">node_ptr</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span> 55 <span class="keyword">static</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> <a class="link" href="linear_slist_algorithms.html#idm45020922156672-bb"><span class="identifier">count</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">const_node_ptr</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span> 56 <span class="keyword">static</span> <span class="keyword">void</span> <a class="link" href="linear_slist_algorithms.html#idm45020922151232-bb"><span class="identifier">swap_trailing_nodes</span></a><span class="special">(</span><span class="identifier">node_ptr</span><span class="special">,</span> <span class="identifier">node_ptr</span><span class="special">)</span><span class="special">;</span> 57 <span class="keyword">static</span> <span class="identifier">node_ptr</span> <a class="link" href="linear_slist_algorithms.html#idm45020922145056-bb"><span class="identifier">reverse</span></a><span class="special">(</span><span class="identifier">node_ptr</span><span class="special">)</span><span class="special">;</span> 58 <span class="keyword">static</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">node_ptr</span><span class="special">,</span> <span class="identifier">node_ptr</span> <span class="special">></span> 59 <a class="link" href="linear_slist_algorithms.html#idm45020922139648-bb"><span class="identifier">move_first_n_backwards</span></a><span class="special">(</span><span class="identifier">node_ptr</span><span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span><span class="special">)</span><span class="special">;</span> 60 <span class="keyword">static</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">node_ptr</span><span class="special">,</span> <span class="identifier">node_ptr</span> <span class="special">></span> 61 <a class="link" href="linear_slist_algorithms.html#idm45020922133408-bb"><span class="identifier">move_first_n_forward</span></a><span class="special">(</span><span class="identifier">node_ptr</span><span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span><span class="special">)</span><span class="special">;</span> 62<span class="special">}</span><span class="special">;</span></pre></div> 63<div class="refsect1"> 64<a name="id-1.3.20.42.16.3.4"></a><h2>Description</h2> 65<p><a class="link" href="linear_slist_algorithms.html" title="Class template linear_slist_algorithms">linear_slist_algorithms</a> provides basic algorithms to manipulate nodes forming a linear singly linked list.</p> 66<p><a class="link" href="linear_slist_algorithms.html" title="Class template linear_slist_algorithms">linear_slist_algorithms</a> is configured with a NodeTraits class, which encapsulates the information about the node to be manipulated. NodeTraits must support the following interface:</p> 67<p><span class="bold"><strong>Typedefs</strong></span>:</p> 68<p><code class="computeroutput">node</code>: The type of the node that forms the linear list</p> 69<p><code class="computeroutput">node_ptr</code>: A pointer to a node</p> 70<p><code class="computeroutput">const_node_ptr</code>: A pointer to a const node</p> 71<p><span class="bold"><strong>Static functions</strong></span>:</p> 72<p><code class="computeroutput">static node_ptr get_next(const_node_ptr n);</code></p> 73<p><code class="computeroutput">static void set_next(node_ptr n, node_ptr next);</code> </p> 74<div class="refsect2"> 75<a name="id-1.3.20.42.16.3.4.11"></a><h3> 76<a name="idm45020922208320-bb"></a><code class="computeroutput">linear_slist_algorithms</code> public static functions</h3> 77<div class="orderedlist"><ol class="orderedlist" type="1"> 78<li class="listitem"> 79<pre class="literallayout"><span class="keyword">static</span> <span class="keyword">void</span> <a name="idm45020922207760-bb"></a><span class="identifier">init</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">node_ptr</span> <span class="special">&</span> this_node<span class="special">)</span><span class="special">;</span></pre> 80<p><span class="bold"><strong>Effects</strong></span>: Constructs an non-used list element, putting the next pointer to null: <code class="computeroutput">NodeTraits::get_next(this_node) == node_ptr()</code></p> 81<p><span class="bold"><strong>Complexity</strong></span>: Constant</p> 82<p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> 83</li> 84<li class="listitem"> 85<pre class="literallayout"><span class="keyword">static</span> <span class="keyword">bool</span> <a name="idm45020922202896-bb"></a><span class="identifier">unique</span><span class="special">(</span><span class="identifier">const_node_ptr</span> this_node<span class="special">)</span><span class="special">;</span></pre> 86<p><span class="bold"><strong>Requires</strong></span>: this_node must be in a circular list or be an empty circular list.</p> 87<p><span class="bold"><strong>Effects</strong></span>: Returns true is "this_node" is the only node of a circular list: or it's a not inserted node: <code class="computeroutput">return node_ptr() == NodeTraits::get_next(this_node) || NodeTraits::get_next(this_node) == this_node</code></p> 88<p><span class="bold"><strong>Complexity</strong></span>: Constant</p> 89<p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> 90</li> 91<li class="listitem"> 92<pre class="literallayout"><span class="keyword">static</span> <span class="keyword">bool</span> <a name="idm45020922197072-bb"></a><span class="identifier">inited</span><span class="special">(</span><span class="identifier">const_node_ptr</span> this_node<span class="special">)</span><span class="special">;</span></pre> 93<p><span class="bold"><strong>Effects</strong></span>: Returns true is "this_node" has the same state as if it was inited using "init(node_ptr)"</p> 94<p><span class="bold"><strong>Complexity</strong></span>: Constant</p> 95<p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> 96</li> 97<li class="listitem"> 98<pre class="literallayout"><span class="keyword">static</span> <span class="keyword">void</span> <a name="idm45020922192512-bb"></a><span class="identifier">unlink_after</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">node_ptr</span> <span class="special">&</span> prev_node<span class="special">)</span><span class="special">;</span></pre> 99<p><span class="bold"><strong>Requires</strong></span>: prev_node must be in a circular list or be an empty circular list.</p> 100<p><span class="bold"><strong>Effects</strong></span>: Unlinks the next node of prev_node from the circular list.</p> 101<p><span class="bold"><strong>Complexity</strong></span>: Constant</p> 102<p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> 103</li> 104<li class="listitem"> 105<pre class="literallayout"><span class="keyword">static</span> <span class="keyword">void</span> <a name="idm45020922187088-bb"></a><span class="identifier">unlink_after</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">node_ptr</span> <span class="special">&</span> prev_node<span class="special">,</span> 106 <span class="keyword">const</span> <span class="identifier">node_ptr</span> <span class="special">&</span> last_node<span class="special">)</span><span class="special">;</span></pre> 107<p><span class="bold"><strong>Requires</strong></span>: prev_node and last_node must be in a circular list or be an empty circular list.</p> 108<p><span class="bold"><strong>Effects</strong></span>: Unlinks the range (prev_node, last_node) from the linear list.</p> 109<p><span class="bold"><strong>Complexity</strong></span>: Constant</p> 110<p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> 111</li> 112<li class="listitem"> 113<pre class="literallayout"><span class="keyword">static</span> <span class="keyword">void</span> <a name="idm45020922180960-bb"></a><span class="identifier">link_after</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">node_ptr</span> <span class="special">&</span> prev_node<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">node_ptr</span> <span class="special">&</span> this_node<span class="special">)</span><span class="special">;</span></pre> 114<p><span class="bold"><strong>Requires</strong></span>: prev_node must be a node of a linear list.</p> 115<p><span class="bold"><strong>Effects</strong></span>: Links this_node after prev_node in the linear list.</p> 116<p><span class="bold"><strong>Complexity</strong></span>: Constant</p> 117<p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> 118</li> 119<li class="listitem"> 120<pre class="literallayout"><span class="keyword">static</span> <span class="keyword">void</span> <a name="idm45020922174880-bb"></a><span class="identifier">transfer_after</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">node_ptr</span> <span class="special">&</span> p<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">node_ptr</span> <span class="special">&</span> b<span class="special">,</span> 121 <span class="keyword">const</span> <span class="identifier">node_ptr</span> <span class="special">&</span> e<span class="special">)</span><span class="special">;</span></pre> 122<p><span class="bold"><strong>Requires</strong></span>: b and e must be nodes of the same linear list or an empty range. and p must be a node of a different linear list.</p> 123<p><span class="bold"><strong>Effects</strong></span>: Removes the nodes from (b, e] range from their linear list and inserts them after p in p's linear list.</p> 124<p><span class="bold"><strong>Complexity</strong></span>: Constant</p> 125<p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> 126</li> 127<li class="listitem"> 128<pre class="literallayout"><span class="keyword">static</span> <span class="keyword">void</span> <a name="idm45020922167984-bb"></a><span class="identifier">init_header</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">node_ptr</span> <span class="special">&</span> this_node<span class="special">)</span><span class="special">;</span></pre> 129<p><span class="bold"><strong>Effects</strong></span>: Constructs an empty list, making this_node the only node of the circular list: <code class="computeroutput">NodeTraits::get_next(this_node) == this_node</code>.</p> 130<p><span class="bold"><strong>Complexity</strong></span>: Constant</p> 131<p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> 132</li> 133<li class="listitem"> 134<pre class="literallayout"><span class="keyword">static</span> <span class="identifier">node_ptr</span> 135<a name="idm45020922162960-bb"></a><span class="identifier">get_previous_node</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">node_ptr</span> <span class="special">&</span> prev_init_node<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">node_ptr</span> <span class="special">&</span> this_node<span class="special">)</span><span class="special">;</span></pre> 136<p><span class="bold"><strong>Requires</strong></span>: this_node and prev_init_node must be in the same linear list.</p> 137<p><span class="bold"><strong>Effects</strong></span>: Returns the previous node of this_node in the linear list starting. the search from prev_init_node. The first node checked for equality is NodeTraits::get_next(prev_init_node).</p> 138<p><span class="bold"><strong>Complexity</strong></span>: Linear to the number of elements between prev_init_node and this_node.</p> 139<p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> 140</li> 141<li class="listitem"> 142<pre class="literallayout"><span class="keyword">static</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> <a name="idm45020922156672-bb"></a><span class="identifier">count</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">const_node_ptr</span> <span class="special">&</span> this_node<span class="special">)</span><span class="special">;</span></pre> 143<p><span class="bold"><strong>Requires</strong></span>: this_node must be in a linear list or be an empty linear list.</p> 144<p><span class="bold"><strong>Effects</strong></span>: Returns the number of nodes in a linear list. If the linear list is empty, returns 1.</p> 145<p><span class="bold"><strong>Complexity</strong></span>: Linear</p> 146<p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> 147</li> 148<li class="listitem"> 149<pre class="literallayout"><span class="keyword">static</span> <span class="keyword">void</span> <a name="idm45020922151232-bb"></a><span class="identifier">swap_trailing_nodes</span><span class="special">(</span><span class="identifier">node_ptr</span> this_node<span class="special">,</span> <span class="identifier">node_ptr</span> other_node<span class="special">)</span><span class="special">;</span></pre> 150<p><span class="bold"><strong>Requires</strong></span>: this_node and other_node must be nodes inserted in linear lists or be empty linear lists.</p> 151<p><span class="bold"><strong>Effects</strong></span>: Moves all the nodes previously chained after this_node after other_node and vice-versa.</p> 152<p><span class="bold"><strong>Complexity</strong></span>: Constant</p> 153<p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> 154</li> 155<li class="listitem"> 156<pre class="literallayout"><span class="keyword">static</span> <span class="identifier">node_ptr</span> <a name="idm45020922145056-bb"></a><span class="identifier">reverse</span><span class="special">(</span><span class="identifier">node_ptr</span> p<span class="special">)</span><span class="special">;</span></pre> 157<p><span class="bold"><strong>Effects</strong></span>: Reverses the order of elements in the list.</p> 158<p><span class="bold"><strong>Returns</strong></span>: The new first node of the list.</p> 159<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p> 160<p><span class="bold"><strong>Complexity</strong></span>: This function is linear to the contained elements. </p> 161</li> 162<li class="listitem"> 163<pre class="literallayout"><span class="keyword">static</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">node_ptr</span><span class="special">,</span> <span class="identifier">node_ptr</span> <span class="special">></span> 164<a name="idm45020922139648-bb"></a><span class="identifier">move_first_n_backwards</span><span class="special">(</span><span class="identifier">node_ptr</span> p<span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> n<span class="special">)</span><span class="special">;</span></pre> 165<p><span class="bold"><strong>Effects</strong></span>: Moves the first n nodes starting at p to the end of the list.</p> 166<p><span class="bold"><strong>Returns</strong></span>: A pair containing the new first and last node of the list or if there has been any movement, a null pair if n leads to no movement.</p> 167<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p> 168<p><span class="bold"><strong>Complexity</strong></span>: Linear to the number of elements plus the number moved positions. </p> 169</li> 170<li class="listitem"> 171<pre class="literallayout"><span class="keyword">static</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">node_ptr</span><span class="special">,</span> <span class="identifier">node_ptr</span> <span class="special">></span> 172<a name="idm45020922133408-bb"></a><span class="identifier">move_first_n_forward</span><span class="special">(</span><span class="identifier">node_ptr</span> p<span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> n<span class="special">)</span><span class="special">;</span></pre> 173<p><span class="bold"><strong>Effects</strong></span>: Moves the first n nodes starting at p to the beginning of the list.</p> 174<p><span class="bold"><strong>Returns</strong></span>: A pair containing the new first and last node of the list or if there has been any movement, a null pair if n leads to no movement.</p> 175<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p> 176<p><span class="bold"><strong>Complexity</strong></span>: Linear to the number of elements plus the number moved positions. </p> 177</li> 178</ol></div> 179</div> 180</div> 181</div> 182<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> 183<td align="left"></td> 184<td align="right"><div class="copyright-footer">Copyright © 2005 Olaf Krzikalla<br>Copyright © 2006-2015 Ion Gaztanaga<p> 185 Distributed under the Boost Software License, Version 1.0. (See accompanying 186 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>) 187 </p> 188</div></td> 189</tr></table> 190<hr> 191<div class="spirit-nav"> 192<a accesskey="p" href="make_hashtable.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../intrusive/reference.html#header.boost.intrusive.linear_slist_algorithms_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="link_mode_type.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a> 193</div> 194</body> 195</html> 196
