boost_mirror/multi_index
1
0
Fork 0
mirror of https://github.com/boostorg/multi_index.git synced 2025-05-11 13:24:04 +00:00
Code Issues Packages Projects Releases Wiki Activity

lexical error

Browse Source 
[SVN r33050]
This commit is contained in:
Joaquín M. López Muñoz 2006-02-21 07:18:14 +00:00
parent cf84a0dc1c
commit c2d7a65cfd
2 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
doc/tutorial/basics.html
View File

@ -78,7 +78,7 @@ two typical use cases.
STL sets and multisets are varying-length containers where elements are efficiently STL sets and multisets are varying-length containers where elements are efficiently
sorted according to a given comparison predicate. These container classes fall short sorted according to a given comparison predicate. These container classes fall short
of functionality when the programmer wishes to efficiently sort and look up the elements of functionality when the programmer wishes to efficiently sort and look up the elements
following a different sorting criterium. Consider for instance: following a different sorting criterion. Consider for instance:
</p> </p>
<blockquote><pre> <blockquote><pre>
@ -1205,7 +1205,7 @@ Index types
<br> <br>
<p>Revised February 6th 2006</p> <p>Revised February 21st 2006</p>
<p>&copy; Copyright 2003-2006 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz. <p>&copy; Copyright 2003-2006 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
Distributed under the Boost Software Distributed under the Boost Software

4
doc/tutorial/index.html
View File

@ -46,7 +46,7 @@ Basics
STL containers are designed around the concept that each container controls its STL containers are designed around the concept that each container controls its
own collection of elements, giving access to them in a manner specified by the own collection of elements, giving access to them in a manner specified by the
container's type: so, an <code>std::set</code> maintains the elements ordered container's type: so, an <code>std::set</code> maintains the elements ordered
by a specified sorting criterium, <code>std::list</code> allows for free by a specified sorting criterion, <code>std::list</code> allows for free
positioning of elements along a linear sequence, and so on. positioning of elements along a linear sequence, and so on.
</p> </p>
@ -126,7 +126,7 @@ Basics
<br> <br>
<p>Revised February 6th 2006</p> <p>Revised February 21st 2006</p>
<p>&copy; Copyright 2003-2006 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz. <p>&copy; Copyright 2003-2006 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
Distributed under the Boost Software Distributed under the Boost Software