summaryrefslogtreecommitdiff
path: root/doc/html/intrusive/concepts.html
diff options
context:
space:
mode:
Diffstat (limited to 'doc/html/intrusive/concepts.html')
-rw-r--r--[-rwxr-xr-x]doc/html/intrusive/concepts.html4
1 files changed, 2 insertions, 2 deletions
diff --git a/doc/html/intrusive/concepts.html b/doc/html/intrusive/concepts.html
index 83bcb907b9..1ff7188096 100755..100644
--- a/doc/html/intrusive/concepts.html
+++ b/doc/html/intrusive/concepts.html
@@ -39,7 +39,7 @@
Algorithms</strong></span> just require a <span class="bold"><strong>NodeTraits</strong></span>
template parameter and they can work with any <span class="bold"><strong>NodeTraits</strong></span>
class that fulfills the needed interface. As an example, here is a class
- that implements operations7' to manage a group of nodes forming a circular
+ that implements operations to manage a group of nodes forming a circular
singly linked list:
</li></ul></div>
<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">NodeTraits</span><span class="special">&gt;</span>
@@ -225,7 +225,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2005 Olaf Krzikalla<br>Copyright &#169; 2006-2011 Ion Gaztanaga<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2005 Olaf Krzikalla<br>Copyright &#169; 2006-2012 Ion Gaztanaga<p>
Distributed under the Boost Software License, Version 1.0. (See accompanying
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>)
</p>