Boost-Commit :

Date view	Thread view	Subject view	Author view

Subject: [Boost-commit] svn:boost r57804 - in trunk/libs/bimap/doc/html: . boost_bimap boost_bimap/bimap_and_boost boost_bimap/examples boost_bimap/history boost_bimap/rationale boost_bimap/reference boost_bimap/the_tutorial
From: daniel_james_at_[hidden]
Date: 2009-11-20 04:47:35

Next message: s.ochsenknecht_at_[hidden]: "[Boost-commit] svn:boost r57805 - in trunk/libs/program_options: src test"
Previous message: daniel_james_at_[hidden]: "[Boost-commit] svn:boost r57803 - in branches/release/boost/bimap: . detail"

Author: danieljames
Date: 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
New Revision: 57804
URL: http://svn.boost.org/trac/boost/changeset/57804

Log:
Rebuild bimap documentation.
Text files modified:
   trunk/libs/bimap/doc/html/boost_bimap/acknowledgements.html | 21
   trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost.html | 34 -
   trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html | 127 +++----
   trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost/dependencies.html | 23
   trunk/libs/bimap/doc/html/boost_bimap/compiler_specifics.html | 28
   trunk/libs/bimap/doc/html/boost_bimap/examples.html | 24
   trunk/libs/bimap/doc/html/boost_bimap/examples/mighty_bimap.html | 20
   trunk/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___bidirectional_map.html | 55 +-
   trunk/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___hashed_indices.html | 42 +-
   trunk/libs/bimap/doc/html/boost_bimap/examples/simple_bimap.html | 35 -
   trunk/libs/bimap/doc/html/boost_bimap/future_work.html | 18
   trunk/libs/bimap/doc/html/boost_bimap/history.html | 25
   trunk/libs/bimap/doc/html/boost_bimap/history/multiindex_and_bimap.html | 25
   trunk/libs/bimap/doc/html/boost_bimap/introduction.html | 78 ++--
   trunk/libs/bimap/doc/html/boost_bimap/one_minute_tutorial.html | 119 ++---
   trunk/libs/bimap/doc/html/boost_bimap/performance.html | 14
   trunk/libs/bimap/doc/html/boost_bimap/rationale.html | 50 +-
   trunk/libs/bimap/doc/html/boost_bimap/rationale/additional_features.html | 54 +-
   trunk/libs/bimap/doc/html/boost_bimap/rationale/code.html | 24
   trunk/libs/bimap/doc/html/boost_bimap/rationale/the_student_and_the_mentor.html | 26
   trunk/libs/bimap/doc/html/boost_bimap/reference.html | 46 +-
   trunk/libs/bimap/doc/html/boost_bimap/reference/bimap_reference.html | 316 ++++++++---------
   trunk/libs/bimap/doc/html/boost_bimap/reference/list_of_reference.html | 649 +++++++++++++++++-------------------
   trunk/libs/bimap/doc/html/boost_bimap/reference/set_of_reference.html | 597 ++++++++++++++++-----------------
   trunk/libs/bimap/doc/html/boost_bimap/reference/unconstrained_set_of_reference.html | 89 ++--
   trunk/libs/bimap/doc/html/boost_bimap/reference/unordered_set_of_reference.html | 581 ++++++++++++++++-----------------
   trunk/libs/bimap/doc/html/boost_bimap/reference/vector_of_reference.html | 695 +++++++++++++++++++--------------------
   trunk/libs/bimap/doc/html/boost_bimap/release_notes.html | 14
   trunk/libs/bimap/doc/html/boost_bimap/test_suite.html | 17
   trunk/libs/bimap/doc/html/boost_bimap/the_tutorial.html | 67 +--
   trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/additional_information.html | 45 +-
   trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/bimaps_with_user_defined_names.html | 35 -
   trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/complete_instantiation_scheme.html | 154 +++----
   trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/controlling_collection_types.html | 100 ++---
   trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/differences_with_standard_maps.html | 62 +--
   trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/discovering_the_bimap_framework.html | 46 +-
   trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/the_collection_of_relations_type.html | 69 +--
   trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/unconstrained_sets.html | 54 +-
   trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/useful_functions.html | 89 ++---
   trunk/libs/bimap/doc/html/index.html | 30
   40 files changed, 2134 insertions(+), 2463 deletions(-)

Modified: trunk/libs/bimap/doc/html/boost_bimap/acknowledgements.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/acknowledgements.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/acknowledgements.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -3,28 +3,27 @@
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>Acknowledgements</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
-<link rel="prev" href="history/multiindex_and_bimap.html" title="MultiIndex
- and Bimap">
+<link rel="prev" href="history/multiindex_and_bimap.html" title="MultiIndex and Bimap">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="history/multiindex_and_bimap.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="Acknowledgements">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="boost_bimap.acknowledgements"></a>Acknowledgements
+<a name="boost_bimap.acknowledgements"></a><a class="link" href="acknowledgements.html" title="Acknowledgements">Acknowledgements</a>
</h2></div></div></div>

 This library was developed in the context of the Google SoC 2006. I first want
@@ -72,8 +71,8 @@
 a lot to Ion Gaztañaga for managing the review.
 
<a name="boost_bimap.acknowledgements.boost_bimap_team"></a><h4>
-<a name="id2735497"></a>
- Boost.Bimap Team
+<a name="id672804"></a>
+ <a class="link" href="acknowledgements.html#boost_bimap.acknowledgements.boost_bimap_team">Boost.Bimap Team</a>
 </h4>

 From Argentina... Matias and Mafalda and from Spain... Joaquin and Hector

Modified: trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -3,30 +3,28 @@
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>Bimap and Boost</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
-<link rel="prev" href="the_tutorial/complete_instantiation_scheme.html" title="Complete
- instantiation scheme">
-<link rel="next" href="bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html" title="Boost
- Libraries that work well with Boost.Bimap">
+<link rel="prev" href="the_tutorial/complete_instantiation_scheme.html" title="Complete instantiation scheme">
+<link rel="next" href="bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html" title="Boost Libraries that work well with Boost.Bimap">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="the_tutorial/complete_instantiation_scheme.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="Bimap and Boost">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="boost_bimap.bimap_and_boost"></a>Bimap and Boost
+<a name="boost_bimap.bimap_and_boost"></a><a class="link" href="bimap_and_boost.html" title="Bimap and Boost">Bimap and Boost</a>
</h2></div></div></div>
<div class="toc"><dl>
<dt><a href="bimap_and_boost.html#boost_bimap.bimap_and_boost.bimap_and_multiindex">Bimap
@@ -47,10 +45,9 @@
</dl></dd>
<dt>Dependencies</dt>
</dl></div>
-<div class="section" lang="en">
+<div class="section" title="Bimap and MultiIndex">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.bimap_and_boost.bimap_and_multiindex"></a><a href="bimap_and_boost.html#boost_bimap.bimap_and_boost.bimap_and_multiindex" title="Bimap
- and MultiIndex">Bimap
+<a name="boost_bimap.bimap_and_boost.bimap_and_multiindex"></a><a class="link" href="bimap_and_boost.html#boost_bimap.bimap_and_boost.bimap_and_multiindex" title="Bimap and MultiIndex">Bimap
 and MultiIndex</a>
</h3></div></div></div>

@@ -104,7 +101,7 @@
 in its own class every time they want to use it as a bidirectional map. Boost.Bimap
 takes advantage of the narrower scope to produce a better interface for bidirectional
 maps
- [<a name="id2644176" href="#ftn.id2644176">2</a>]
+ [<a name="id583056" href="#ftn.id583056" class="footnote">2</a>]
 . There is no learning curve if you know how to use standard containers.
 Great effort was put into mapping the naming scheme of the STL to Boost.Bimap.
 The library is designed to match the common STL containers.
@@ -117,6 +114,7 @@
 types. There exist some problems that are better modelled with Boost.MultiIndex.
 
<div class="sidebar">
+

 Problem I - An employee register
 
@@ -132,6 +130,7 @@
 
</div>
<div class="sidebar">
+

 Problem II - A partners container
 
@@ -146,14 +145,13 @@
 
</div>

- You can also read <a href="the_tutorial/additional_information.html" title="Additional
- information">Additional
+ You can also read <a class="link" href="the_tutorial/additional_information.html" title="Additional information">Additional
 Information</a> for more information about the relation of this two libraries.
 
</div>
<div class="footnotes">
 <hr width="100" align="left">
-<div class="footnote">[<a name="ftn.id2644176" href="#id2644176">2</a>] 
+<div class="footnote">[<a name="ftn.id583056" href="#id583056" class="para">2</a>] 
 In the same fashion, Boost.MRU will allow the creation of most
 recent updated aware containers, hiding the complexity of
 Boost.MultiIndex.

Modified: trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -1,11 +1,10 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Boost
- Libraries that work well with Boost.Bimap</title>
+<title>Boost Libraries that work well with Boost.Bimap</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../bimap_and_boost.html" title="Bimap and Boost">
<link rel="prev" href="../bimap_and_boost.html" title="Bimap and Boost">
<link rel="next" href="dependencies.html" title="Dependencies">
@@ -13,20 +12,19 @@
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="../bimap_and_boost.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bimap_and_boost.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="dependencies.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="Boost Libraries that work well with Boost.Bimap">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap"></a><a href="boost_libraries_that_work_well_with_boost_bimap.html" title="Boost
- Libraries that work well with Boost.Bimap">Boost
+<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap"></a><a class="link" href="boost_libraries_that_work_well_with_boost_bimap.html" title="Boost Libraries that work well with Boost.Bimap">Boost
 Libraries that work well with Boost.Bimap</a>
</h3></div></div></div>
<div class="toc"><dl>
@@ -41,9 +39,9 @@
<dt>Boost.Xpressive</dt>
<dt>Boost.Property_map</dt>
</dl></div>
-<div class="section" lang="en">
+<div class="section" title="Introduction">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.introduction"></a>Introduction
+<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.introduction"></a><a class="link" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.introduction" title="Introduction">Introduction</a>
</h4></div></div></div>
<div class="informaltable"><table class="table">
<colgroup>
@@ -282,9 +280,9 @@
</tbody>
</table></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Boost.Serialization">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_serialization"></a>Boost.Serialization
+<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_serialization"></a><a class="link" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_serialization" title="Boost.Serialization">Boost.Serialization</a>
</h4></div></div></div>

 A bimap can be archived and retrieved by means of the Boost.Serialization
@@ -300,8 +298,7 @@



-<pre class="programlisting">
-typedef bimap< std::string, int > bm_type;
+<pre class="programlisting">typedef bimap< std::string, int > bm_type;

// Create a bimap and serialize it to a file
{
@@ -312,9 +309,9 @@
 std::ofstream ofs("data");
 boost::archive::text_oarchive oa(ofs);

- oa << const_cast<const bm_type&>(bm); <a name="boost_bimap16co" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap16"><img src="../../images/callouts/1.png" alt="1" border="0"></a>
+ oa << const_cast<const bm_type&>(bm); <a class="co" name="boost_bimap16co" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap16"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>

- <a name="boost_bimap17co" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap17"><img src="../../images/callouts/2.png" alt="2" border="0"></a>const bm_type::left_iterator left_iter = bm.left.find("two");
+ <a class="co" name="boost_bimap17co" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap17"><img src="../../../../../../doc/src/images/callouts/2.png" alt="2" border="0"></a>const bm_type::left_iterator left_iter = bm.left.find("two");
 oa << left_iter;

 const bm_type::right_iterator right_iter = bm.right.find(1);
@@ -351,16 +348,14 @@
 
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
-<td width="5%" valign="top" align="left">
-<a name="boost_bimap16"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap16"></a> </td>
<td valign="top" align="left">
 We must do a const cast because Boost.Serialization archives only save
 const objects. Read Boost.Serializartion docs for the rationale behind
 this decision </td>
</tr>
<tr>
-<td width="5%" valign="top" align="left">
-<a name="boost_bimap17"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap17"></a> </td>
<td valign="top" align="left"> We can only serialize iterators if the bimap was serialized
 first. Note that the const cast is not requiered here because we create
 our iterators as const. </td>
@@ -380,7 +375,7 @@
 in build times, and may be necessary in those defective compilers that
 fail to correctly process Boost.Serialization headers.
 
-<div class="warning"><table border="0" summary="Warning">
+<div class="warning" title="Warning"><table border="0" summary="Warning">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../../../doc/html/images/warning.png"></td>
<th align="left">Warning</th>
@@ -408,9 +403,9 @@
 must be done only after serializing its corresponding container.
 
</div>
-<div class="section" lang="en">
+<div class="section" title="Boost.Assign">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_assign"></a>Boost.Assign
+<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_assign"></a><a class="link" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_assign" title="Boost.Assign">Boost.Assign</a>
</h4></div></div></div>

 The purpose of this library is to make it easy to fill containers with
@@ -438,12 +433,11 @@



-<pre class="programlisting">
- typedef bimap< multiset_of< int >, list_of< std::string > > bm_type;
+<pre class="programlisting"> typedef bimap< multiset_of< int >, list_of< std::string > > bm_type;

 // We can use assign::list_of to initialize the container.

- bm_type bm = assign::list_of< bm_type::relation > <a name="boost_bimap18co" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap18"><img src="../../images/callouts/1.png" alt="1" border="0"></a>
+ bm_type bm = assign::list_of< bm_type::relation > <a class="co" name="boost_bimap18co" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap18"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>
 ( 1, "one" )
 ( 2, "two" )
 ( 3, "three" );
@@ -480,8 +474,7 @@

 
<div class="calloutlist"><table border="0" summary="Callout list"><tr>
-<td width="5%" valign="top" align="left">
-<a name="boost_bimap18"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap18"></a> </td>
<td valign="top" align="left">
 Note that <code class="computeroutput">bm_type::relation</code> has to be used instead of
 <code class="computeroutput">bm_type::value_type</code>. Contrary to <code class="computeroutput">value_type</code>, <code class="computeroutput">relation</code>
@@ -492,9 +485,9 @@

 
</div>
-<div class="section" lang="en">
+<div class="section" title="Boost.Hash">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_hash"></a>Boost.Hash
+<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_hash"></a><a class="link" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_hash" title="Boost.Hash">Boost.Hash</a>
</h4></div></div></div>

 The hash function is the very core of the fast lookup capabilities of the
@@ -513,14 +506,14 @@
 results.
 

- Boost.Hash can be <a href="http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/hash/custom.html" target="_top">extended
+ Boost.Hash can be <a href="http://www.boost.org/doc/html/hash/custom.html" target="_top">extended
 for custom data types</a>, enabling to use the default parameter of
 the unordered set types with any user types.
 
</div>
-<div class="section" lang="en">
+<div class="section" title="Boost.Lambda">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_lambda"></a>Boost.Lambda
+<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_lambda"></a><a class="link" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_lambda" title="Boost.Lambda">Boost.Lambda</a>
</h4></div></div></div>

 The Boost Lambda Library (BLL in the sequel) is a C++ template library,
@@ -544,8 +537,7 @@



-<pre class="programlisting">
-typedef bimap< std::string, int > bm_type;
+<pre class="programlisting">typedef bimap< std::string, int > bm_type;

bm_type bm;
bm.insert( bm_type::value_type("one",1) );
@@ -562,9 +554,9 @@

 
</div>
-<div class="section" lang="en">
+<div class="section" title="Boost.Range">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_range"></a>Boost.Range
+<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_range"></a><a class="link" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_range" title="Boost.Range">Boost.Range</a>
</h4></div></div></div>

 Boost.Range is a collection of concepts and utilities that are particularly
@@ -590,8 +582,7 @@



-<pre class="programlisting">
-template< class ForwardReadableRange, class UnaryFunctor >
+<pre class="programlisting">template< class ForwardReadableRange, class UnaryFunctor >
UnaryFunctor for_each(const ForwardReadableRange & r, UnaryFunctor func)
{
 typedef typename
@@ -635,8 +626,7 @@



-<pre class="programlisting">
-struct pair_printer
+<pre class="programlisting">struct pair_printer
{
 pair_printer(std::ostream & o) : os(o) {}
 template< class Pair >
@@ -693,9 +683,9 @@
 <a href="../../../../example/bimap_and_boost/range.cpp" target="_top">Go to source code</a>
 
</div>
-<div class="section" lang="en">
+<div class="section" title="Boost.Foreach">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_foreach"></a>Boost.Foreach
+<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_foreach"></a><a class="link" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_foreach" title="Boost.Foreach">Boost.Foreach</a>
</h4></div></div></div>

 In C++, writing a loop that iterates over a sequence is tedious. We can
@@ -717,8 +707,7 @@



-<pre class="programlisting">
-typedef bimap< std::string, list_of<int> > bm_type;
+<pre class="programlisting">typedef bimap< std::string, list_of<int> > bm_type;

bm_type bm;
bm.insert( bm_type::value_type("1", 1) );
@@ -728,7 +717,7 @@

BOOST_FOREACH( bm_type::left_reference p, bm.left )
{
- ++p.second; <a name="boost_bimap19co" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap19"><img src="../../images/callouts/1.png" alt="1" border="0"></a>
+ ++p.second; <a class="co" name="boost_bimap19co" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap19"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>
}

BOOST_FOREACH( bm_type::right_const_reference p, bm.right )
@@ -744,8 +733,7 @@

 
<div class="calloutlist"><table border="0" summary="Callout list"><tr>
-<td width="5%" valign="top" align="left">
-<a name="boost_bimap19"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap19"></a> </td>
<td valign="top" align="left"> We can modify the right element because we have use a mutable collection
 type in the right side. </td>
</tr></table></div>
@@ -761,8 +749,7 @@



-<pre class="programlisting">
-BOOST_FOREACH( bm_type::left_reference p,
+<pre class="programlisting">BOOST_FOREACH( bm_type::left_reference p,
 ( bm.left.range( std::string("1") <= _key, _key < std::string("3") ) ))
{
 ++p.second;
@@ -782,21 +769,19 @@
 <a href="../../../../example/bimap_and_boost/foreach.cpp" target="_top">Go to source code</a>
 
</div>
-<div class="section" lang="en">
+<div class="section" title="Boost.Typeof">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_typeof"></a>Boost.Typeof
+<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_typeof"></a><a class="link" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_typeof" title="Boost.Typeof">Boost.Typeof</a>
</h4></div></div></div>

 Once C++0x is out we are going to be able to write code like:
 
-<pre class="programlisting">
-auto iter = bm.by<name>().find("john");
+<pre class="programlisting">auto iter = bm.by<name>().find("john");
</pre>

 instead of the more verbose
 
-<pre class="programlisting">
-bm_type::map_by<name>::iterator iter = bm.by<name>().find("john");
+<pre class="programlisting">bm_type::map_by<name>::iterator iter = bm.by<name>().find("john");
</pre>

 Boost.Typeof defines a macro BOOST_AUTO that can be used as a library solution
@@ -810,8 +795,7 @@



-<pre class="programlisting">
-typedef bimap< tagged<std::string,name>, tagged<int,number> > bm_type;
+<pre class="programlisting">typedef bimap< tagged<std::string,name>, tagged<int,number> > bm_type;
bm_type bm;
bm.insert( bm_type::value_type("one" ,1) );
bm.insert( bm_type::value_type("two" ,2) );
@@ -828,8 +812,7 @@



-<pre class="programlisting">
-for( bm_type::map_by<name>::iterator iter = bm.by<name>().begin();
+<pre class="programlisting">for( bm_type::map_by<name>::iterator iter = bm.by<name>().begin();
 iter!=bm.by<name>().end(); ++iter)
{
 std::cout << iter->first << " --> " << iter->second << std::endl;
@@ -850,8 +833,7 @@



-<pre class="programlisting">
-for( BOOST_AUTO(iter, bm.by<name>().begin()); iter!=bm.by<name>().end(); ++iter)
+<pre class="programlisting">for( BOOST_AUTO(iter, bm.by<name>().begin()); iter!=bm.by<name>().end(); ++iter)
{
 std::cout << iter->first << " --> " << iter->second << std::endl;
}
@@ -867,9 +849,9 @@
 <a href="../../../../example/bimap_and_boost/typeof.cpp" target="_top">Go to source code</a>
 
</div>
-<div class="section" lang="en">
+<div class="section" title="Boost.Xpressive">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_xpressive"></a>Boost.Xpressive
+<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_xpressive"></a><a class="link" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_xpressive" title="Boost.Xpressive">Boost.Xpressive</a>
</h4></div></div></div>

 Using Boost.Xpressive we can parse a file and insert the relations in a
@@ -881,8 +863,7 @@



-<pre class="programlisting">
-typedef bimap< std::string, int > bm_type;
+<pre class="programlisting">typedef bimap< std::string, int > bm_type;
bm_type bm;

std::string rel_str("one <--> 1 two <--> 2 three <--> 3");
@@ -906,9 +887,9 @@
 <a href="../../../../example/bimap_and_boost/xpressive.cpp" target="_top">Go to source code</a>
 
</div>
-<div class="section" lang="en">
+<div class="section" title="Boost.Property_map">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_property_map"></a>Boost.Property_map
+<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_property_map"></a><a class="link" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_property_map" title="Boost.Property_map">Boost.Property_map</a>
</h4></div></div></div>

 The Boost Property Map Library consists mainly of interface specifications
@@ -934,8 +915,7 @@
 are read-write property maps. In order to use these, you need to include
 one of the following headers:
 
-<pre class="programlisting">
-#include <boost/bimap/property_map/set_support.hpp>
+<pre class="programlisting">#include <boost/bimap/property_map/set_support.hpp>
#include <boost/bimap/property_map/unordered_set_support.hpp>
</pre>

@@ -950,8 +930,7 @@



-<pre class="programlisting">
-template <typename AddressMap>
+<pre class="programlisting">template <typename AddressMap>
void foo(AddressMap & address_map)
{
 typedef typename boost::property_traits<AddressMap>::value_type value_type;

Modified: trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost/dependencies.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost/dependencies.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost/dependencies.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -3,29 +3,28 @@
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>Dependencies</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../bimap_and_boost.html" title="Bimap and Boost">
-<link rel="prev" href="boost_libraries_that_work_well_with_boost_bimap.html" title="Boost
- Libraries that work well with Boost.Bimap">
+<link rel="prev" href="boost_libraries_that_work_well_with_boost_bimap.html" title="Boost Libraries that work well with Boost.Bimap">
<link rel="next" href="../reference.html" title="Reference">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="boost_libraries_that_work_well_with_boost_bimap.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bimap_and_boost.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../reference.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="Dependencies">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.bimap_and_boost.dependencies"></a>Dependencies
+<a name="boost_bimap.bimap_and_boost.dependencies"></a><a class="link" href="dependencies.html" title="Dependencies">Dependencies</a>
</h3></div></div></div>

 Boost.Bimap is built on top of several Boost libraries. The rationale behind
@@ -36,7 +35,7 @@
 is the heart of this library.
 
<div class="table">
-<a name="id2653168"></a>Table 1.4. Boost Libraries needed by Boost.Bimap
+<a name="id591722"></a>Table 1.4. Boost Libraries needed by Boost.Bimap
<div class="table-contents"><table class="table" summary="Boost Libraries needed by Boost.Bimap">
<colgroup>
<col>
@@ -185,7 +184,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id2653442"></a>Table 1.5. Optional Boost Libraries
+<a name="id591995"></a>Table 1.5. Optional Boost Libraries
<div class="table-contents"><table class="table" summary="Optional Boost Libraries">
<colgroup>
<col>
@@ -355,7 +354,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id2653728"></a>Table 1.6. Additional Boost Libraries needed to run
+<a name="id592279"></a>Table 1.6. Additional Boost Libraries needed to run
 the test-suite
<div class="table-contents"><table class="table" summary="Additional Boost Libraries needed to run
 the test-suite">

Modified: trunk/libs/bimap/doc/html/boost_bimap/compiler_specifics.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/compiler_specifics.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/compiler_specifics.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -3,29 +3,28 @@
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>Compiler specifics</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
-<link rel="prev" href="reference/unconstrained_set_of_reference.html" title="unconstrained_set_of
- Reference">
+<link rel="prev" href="reference/unconstrained_set_of_reference.html" title="unconstrained_set_of Reference">
<link rel="next" href="performance.html" title="Performance">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="reference/unconstrained_set_of_reference.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="performance.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="Compiler specifics">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="boost_bimap.compiler_specifics"></a>Compiler specifics
+<a name="boost_bimap.compiler_specifics"></a><a class="link" href="compiler_specifics.html" title="Compiler specifics">Compiler specifics</a>
</h2></div></div></div>
<div class="informaltable"><table class="table">
<colgroup>
@@ -326,8 +325,8 @@
</tbody>
</table></div>
<a name="boost_bimap.compiler_specifics.vs_7_1"></a><h3>
-<a name="id2712269"></a>
- VS 7.1
+<a name="id650190"></a>
+ <a class="link" href="compiler_specifics.html#boost_bimap.compiler_specifics.vs_7_1">VS 7.1</a>
 </h3>

 If a .cpp file uses more than four differents bimaps the compiler will run
@@ -335,8 +334,8 @@
 in msdn is to split the .cpp in several files or upgrade your compiler.
 
<a name="boost_bimap.compiler_specifics.vs_8_0"></a><h3>
-<a name="id2712297"></a>
- VS 8.0
+<a name="id650218"></a>
+ <a class="link" href="compiler_specifics.html#boost_bimap.compiler_specifics.vs_8_0">VS 8.0</a>
 </h3>

 VC++ 8.0 warns on usage of certain Standard Library and API functions that
@@ -347,8 +346,7 @@
 In order to turn off the warnings add the followings defines at the begging
 of your .cpp files:
 
-<pre class="programlisting">
-#define _CRT_SECURE_NO_DEPRECATE
+<pre class="programlisting">#define _CRT_SECURE_NO_DEPRECATE
#define _SCL_SECURE_NO_DEPRECATE
</pre>
</div>

Modified: trunk/libs/bimap/doc/html/boost_bimap/examples.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/examples.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/examples.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -3,8 +3,8 @@
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>Examples</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="prev" href="performance.html" title="Performance">
<link rel="next" href="examples/simple_bimap.html" title="Simple Bimap">
@@ -12,19 +12,19 @@
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="performance.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="examples/simple_bimap.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="Examples">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="boost_bimap.examples"></a>Examples
+<a name="boost_bimap.examples"></a><a class="link" href="examples.html" title="Examples">Examples</a>
</h2></div></div></div>
<div class="toc"><dl>
<dt>Examples list</dt>
@@ -35,16 +35,16 @@
<dt><a href="examples/multiindex_to_bimap_path___hashed_indices.html">MultiIndex
 to Bimap Path - Hashed indices</a></dt>
</dl></div>
-<div class="section" lang="en">
+<div class="section" title="Examples list">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.examples.examples_list"></a>Examples list
+<a name="boost_bimap.examples.examples_list"></a><a class="link" href="examples.html#boost_bimap.examples.examples_list" title="Examples list">Examples list</a>
</h3></div></div></div>

 In the folder libs/bimap/example you can
 find all the examples used in bimap documentation. Here is a list of them:
 
<div class="table">
-<a name="id2712419"></a>Table 1.7. Tutorial examples
+<a name="id650327"></a>Table 1.7. Tutorial examples
<div class="table-contents"><table class="table" summary="Tutorial examples">
<colgroup>
<col>
@@ -238,7 +238,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id2712899"></a>Table 1.8. Bimap and Boost examples
+<a name="id650801"></a>Table 1.8. Bimap and Boost examples
<div class="table-contents"><table class="table" summary="Bimap and Boost examples">
<colgroup>
<col>
@@ -361,7 +361,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id2713119"></a>Table 1.9. Boost.MultiIndex to Boost.Bimap path examples
+<a name="id651020"></a>Table 1.9. Boost.MultiIndex to Boost.Bimap path examples
<div class="table-contents"><table class="table" summary="Boost.MultiIndex to Boost.Bimap path examples">
<colgroup>
<col>

Modified: trunk/libs/bimap/doc/html/boost_bimap/examples/mighty_bimap.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/examples/mighty_bimap.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/examples/mighty_bimap.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -3,29 +3,28 @@
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>Mighty Bimap</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../examples.html" title="Examples">
<link rel="prev" href="simple_bimap.html" title="Simple Bimap">
-<link rel="next" href="multiindex_to_bimap_path___bidirectional_map.html" title="MultiIndex
- to Bimap Path - Bidirectional Map">
+<link rel="next" href="multiindex_to_bimap_path___bidirectional_map.html" title="MultiIndex to Bimap Path - Bidirectional Map">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="simple_bimap.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="multiindex_to_bimap_path___bidirectional_map.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="Mighty Bimap">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.examples.mighty_bimap"></a>Mighty Bimap
+<a name="boost_bimap.examples.mighty_bimap"></a><a class="link" href="mighty_bimap.html" title="Mighty Bimap">Mighty Bimap</a>
</h3></div></div></div>

This is the translator example from the tutorial. In this example the collection
@@ -39,8 +38,7 @@



-<pre class="programlisting">
-#include <iostream>
+<pre class="programlisting">#include <iostream>
#include <string>
#include <boost/bimap/bimap.hpp>
#include <boost/bimap/list_of.hpp>

Modified: trunk/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___bidirectional_map.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___bidirectional_map.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___bidirectional_map.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -1,49 +1,49 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>MultiIndex
- to Bimap Path - Bidirectional Map</title>
+<title>MultiIndex to Bimap Path - Bidirectional Map</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../examples.html" title="Examples">
<link rel="prev" href="mighty_bimap.html" title="Mighty Bimap">
-<link rel="next" href="multiindex_to_bimap_path___hashed_indices.html" title="MultiIndex
- to Bimap Path - Hashed indices">
+<link rel="next" href="multiindex_to_bimap_path___hashed_indices.html" title="MultiIndex to Bimap Path - Hashed indices">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="mighty_bimap.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="multiindex_to_bimap_path___hashed_indices.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="MultiIndex to Bimap Path - Bidirectional Map">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.examples.multiindex_to_bimap_path___bidirectional_map"></a><a href="multiindex_to_bimap_path___bidirectional_map.html" title="MultiIndex
- to Bimap Path - Bidirectional Map">MultiIndex
+<a name="boost_bimap.examples.multiindex_to_bimap_path___bidirectional_map"></a><a class="link" href="multiindex_to_bimap_path___bidirectional_map.html" title="MultiIndex to Bimap Path - Bidirectional Map">MultiIndex
 to Bimap Path - Bidirectional Map</a>
</h3></div></div></div>

 This is example 4 in Boost.MultiIndex documentation.
 
-<div class="sidebar">
+<div class="sidebar">
+
+
 This example shows how to construct a bidirectional map with multi_index_container.
 By a bidirectional map we mean a container of elements of <code class="computeroutput">std::pair<const FromType,const ToType></code> such that no two elements exists with
 the same first or second value (<code class="computeroutput">std::map</code> only
 guarantees uniqueness of the first member). Fast look-up is provided for
 both keys. The program features a tiny Spanish-English dictionary with on-line
 query of words in both languages.
- </div>
+ 
+</div>
<a name="boost_bimap.examples.multiindex_to_bimap_path___bidirectional_map.boost_multiindex"></a><h5>
-<a name="id2718093"></a>
- Boost.MultiIndex
+<a name="id655859"></a>
+ <a class="link" href="multiindex_to_bimap_path___bidirectional_map.html#boost_bimap.examples.multiindex_to_bimap_path___bidirectional_map.boost_multiindex">Boost.MultiIndex</a>
 </h5>

 <a href="../../../../example/mi_to_b_path/mi_bidirectional_map.cpp" target="_top">Go to source
@@ -54,8 +54,7 @@



-<pre class="programlisting">
-#include <iostream>
+<pre class="programlisting">#include <iostream>
#include <boost/tokenizer.hpp>

#include <boost/multi_index_container.hpp>
@@ -151,8 +150,8 @@

 
<a name="boost_bimap.examples.multiindex_to_bimap_path___bidirectional_map.boost_bimap"></a><h5>
-<a name="id2719852"></a>
- Boost.Bimap
+<a name="id657572"></a>
+ <a class="link" href="multiindex_to_bimap_path___bidirectional_map.html#boost_bimap.examples.multiindex_to_bimap_path___bidirectional_map.boost_bimap">Boost.Bimap</a>
 </h5>

 <a href="../../../../example/mi_to_b_path/bidirectional_map.cpp" target="_top">Go to source
@@ -163,8 +162,7 @@



-<pre class="programlisting">
-#include <iostream>
+<pre class="programlisting">#include <iostream>
#include <boost/tokenizer.hpp>
#include <boost/bimap/bimap.hpp>

@@ -200,7 +198,7 @@
 // the second part of the element is the equivalent in English

 std::cout << word << " is said "
- << it->second <a name="boost_bimap23co" href="multiindex_to_bimap_path___bidirectional_map.html#boost_bimap23"><img src="../../images/callouts/1.png" alt="1" border="0"></a>
+ << it->second <a class="co" name="boost_bimap23co" href="multiindex_to_bimap_path___bidirectional_map.html#boost_bimap23"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>
 << " in English" << std::endl;
 }
 else
@@ -211,7 +209,7 @@
 if( it2 != d.right.end() )
 {
 std::cout << word << " is said "
- << it2->second <a name="boost_bimap24co" href="multiindex_to_bimap_path___bidirectional_map.html#boost_bimap24"><img src="../../images/callouts/2.png" alt="2" border="0"></a>
+ << it2->second <a class="co" name="boost_bimap24co" href="multiindex_to_bimap_path___bidirectional_map.html#boost_bimap24"><img src="../../../../../../doc/src/images/callouts/2.png" alt="2" border="0"></a>
 << " in Spanish" << std::endl;
 }
 else
@@ -231,15 +229,13 @@
 
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
-<td width="5%" valign="top" align="left">
-<a name="boost_bimap23"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap23"></a> </td>
<td valign="top" align="left"> <code class="computeroutput">it</code> is an iterator of the
 left view, so <code class="computeroutput">it->second</code> refers to the right element of
 the relation, the word in english </td>
</tr>
<tr>
-<td width="5%" valign="top" align="left">
-<a name="boost_bimap24"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap24"></a> </td>
<td valign="top" align="left"> <code class="computeroutput">it2</code>
 is an iterator of the right view, so <code class="computeroutput">it2->second</code>
 refers to the left element of the relation, the word in spanish </td>
@@ -261,8 +257,7 @@



-<pre class="programlisting">
-#include <iostream>
+<pre class="programlisting">#include <iostream>

#include <boost/bimap/bimap.hpp>

Modified: trunk/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___hashed_indices.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___hashed_indices.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___hashed_indices.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -1,47 +1,47 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>MultiIndex
- to Bimap Path - Hashed indices</title>
+<title>MultiIndex to Bimap Path - Hashed indices</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../examples.html" title="Examples">
-<link rel="prev" href="multiindex_to_bimap_path___bidirectional_map.html" title="MultiIndex
- to Bimap Path - Bidirectional Map">
+<link rel="prev" href="multiindex_to_bimap_path___bidirectional_map.html" title="MultiIndex to Bimap Path - Bidirectional Map">
<link rel="next" href="../test_suite.html" title="Test suite">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="multiindex_to_bimap_path___bidirectional_map.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../test_suite.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="MultiIndex to Bimap Path - Hashed indices">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.examples.multiindex_to_bimap_path___hashed_indices"></a><a href="multiindex_to_bimap_path___hashed_indices.html" title="MultiIndex
- to Bimap Path - Hashed indices">MultiIndex
+<a name="boost_bimap.examples.multiindex_to_bimap_path___hashed_indices"></a><a class="link" href="multiindex_to_bimap_path___hashed_indices.html" title="MultiIndex to Bimap Path - Hashed indices">MultiIndex
 to Bimap Path - Hashed indices</a>
</h3></div></div></div>

 This is example 8 of Boost.MultiIndex.
 
-<div class="sidebar">
+<div class="sidebar">
+
+
 Hashed indices can be used as an alternative to ordered indices when fast
 look-up is needed and sorting information is of no interest. The example
 features a word counter where duplicate entries are checked by means of a
 hashed index.
- </div>
+ 
+</div>
<a name="boost_bimap.examples.multiindex_to_bimap_path___hashed_indices.boost_multiindex"></a><h5>
-<a name="id2722582"></a>
- Boost.MultiIndex
+<a name="id660222"></a>
+ <a class="link" href="multiindex_to_bimap_path___hashed_indices.html#boost_bimap.examples.multiindex_to_bimap_path___hashed_indices.boost_multiindex">Boost.MultiIndex</a>
 </h5>

 <a href="../../../../example/mi_to_b_path/mi_hashed_indices.cpp" target="_top">Go to source
@@ -52,8 +52,7 @@



-<pre class="programlisting">
-#include <iostream>
+<pre class="programlisting">#include <iostream>
#include <iomanip>

#include <boost/tokenizer.hpp>
@@ -141,8 +140,8 @@

 
<a name="boost_bimap.examples.multiindex_to_bimap_path___hashed_indices.boost_bimap"></a><h5>
-<a name="id2724327"></a>
- Boost.Bimap
+<a name="id661922"></a>
+ <a class="link" href="multiindex_to_bimap_path___hashed_indices.html#boost_bimap.examples.multiindex_to_bimap_path___hashed_indices.boost_bimap">Boost.Bimap</a>
 </h5>

 <a href="../../../../example/mi_to_b_path/hashed_indices.cpp" target="_top">Go to source code</a>
@@ -152,8 +151,7 @@



-<pre class="programlisting">
-#include <iostream>
+<pre class="programlisting">#include <iostream>
#include <iomanip>

#include <boost/tokenizer.hpp>

Modified: trunk/libs/bimap/doc/html/boost_bimap/examples/simple_bimap.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/examples/simple_bimap.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/examples/simple_bimap.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -3,8 +3,8 @@
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>Simple Bimap</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../examples.html" title="Examples">
<link rel="prev" href="../examples.html" title="Examples">
<link rel="next" href="mighty_bimap.html" title="Mighty Bimap">
@@ -12,19 +12,19 @@
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="../examples.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="mighty_bimap.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="Simple Bimap">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.examples.simple_bimap"></a>Simple Bimap
+<a name="boost_bimap.examples.simple_bimap"></a><a class="link" href="simple_bimap.html" title="Simple Bimap">Simple Bimap</a>
</h3></div></div></div>

 This is the example from the one minute tutorial section.
@@ -37,8 +37,7 @@



-<pre class="programlisting">
-#include <string>
+<pre class="programlisting">#include <string>
#include <iostream>

#include <boost/bimap.hpp>
@@ -110,8 +109,7 @@



-<pre class="programlisting">
-#include <iostream>
+<pre class="programlisting">#include <iostream>

#include <boost/bimap.hpp>

@@ -142,12 +140,12 @@
 std::cout << "Countries names ordered by their final position:"
 << std::endl;

- <a name="boost_bimap20co" href="simple_bimap.html#boost_bimap20"><img src="../../images/callouts/1.png" alt="1" border="0"></a>for( results_bimap::map_by<place>::const_iterator
+ <a class="co" name="boost_bimap20co" href="simple_bimap.html#boost_bimap20"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>for( results_bimap::map_by<place>::const_iterator
 i = results.by<place>().begin(),
 iend = results.by<place>().end() ;
 i != iend; ++i )
 {
- <a name="boost_bimap21co" href="simple_bimap.html#boost_bimap21"><img src="../../images/callouts/2.png" alt="2" border="0"></a>std::cout << i->get<place >() << ") "
+ <a class="co" name="boost_bimap21co" href="simple_bimap.html#boost_bimap21"><img src="../../../../../../doc/src/images/callouts/2.png" alt="2" border="0"></a>std::cout << i->get<place >() << ") "
 << i->get<country>() << std::endl;
 }

@@ -156,7 +154,7 @@
 "their final position:"
 << std::endl;

- <a name="boost_bimap22co" href="simple_bimap.html#boost_bimap22"><img src="../../images/callouts/3.png" alt="3" border="0"></a>for( results_bimap::map_by<country>::const_iterator
+ <a class="co" name="boost_bimap22co" href="simple_bimap.html#boost_bimap22"><img src="../../../../../../doc/src/images/callouts/3.png" alt="3" border="0"></a>for( results_bimap::map_by<country>::const_iterator
 i = results.by<country>().begin(),
 iend = results.by<country>().end() ;
 i != iend; ++i )
@@ -177,21 +175,18 @@
 
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
-<td width="5%" valign="top" align="left">
-<a name="boost_bimap20"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap20"></a> </td>
<td valign="top" align="left"> <code class="computeroutput">results.by<place>()</code>
 is equivalent to <code class="computeroutput">results.right</code>
 </td>
</tr>
<tr>
-<td width="5%" valign="top" align="left">
-<a name="boost_bimap21"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap21"></a> </td>
<td valign="top" align="left"> <code class="computeroutput">get<Tag></code>
 works for each view of the bimap </td>
</tr>
<tr>
-<td width="5%" valign="top" align="left">
-<a name="boost_bimap22"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap22"></a> </td>
<td valign="top" align="left"> <code class="computeroutput">results.by<country>()</code>
 is equivalent to <code class="computeroutput">results.left</code>
 </td>

Modified: trunk/libs/bimap/doc/html/boost_bimap/future_work.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/future_work.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/future_work.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -3,8 +3,8 @@
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>Future work</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="prev" href="test_suite.html" title="Test suite">
<link rel="next" href="release_notes.html" title="Release notes">
@@ -12,23 +12,23 @@
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="test_suite.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="release_notes.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="Future work">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="boost_bimap.future_work"></a>Future work
+<a name="boost_bimap.future_work"></a><a class="link" href="future_work.html" title="Future work">Future work</a>
</h2></div></div></div>
<a name="boost_bimap.future_work.rearrange_function"></a><h4>
-<a name="id2726859"></a>
- Rearrange Function
+<a name="id664672"></a>
+ <a class="link" href="future_work.html#boost_bimap.future_work.rearrange_function">Rearrange Function</a>
</h4>

Boost.MultiIndex includes some others functions that can be included in the

Modified: trunk/libs/bimap/doc/html/boost_bimap/history.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/history.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/history.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -3,30 +3,28 @@
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>History</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
-<link rel="prev" href="rationale/the_student_and_the_mentor.html" title="The
- student and the mentor">
-<link rel="next" href="history/multiindex_and_bimap.html" title="MultiIndex
- and Bimap">
+<link rel="prev" href="rationale/the_student_and_the_mentor.html" title="The student and the mentor">
+<link rel="next" href="history/multiindex_and_bimap.html" title="MultiIndex and Bimap">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="rationale/the_student_and_the_mentor.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="history/multiindex_and_bimap.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="History">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="boost_bimap.history"></a>History
+<a name="boost_bimap.history"></a><a class="link" href="history.html" title="History">History</a>
</h2></div></div></div>
<div class="toc"><dl>
<dt><a href="history.html#boost_bimap.history.the_long_path_from_code_project_to_boost">The
@@ -34,10 +32,9 @@
<dt><a href="history/multiindex_and_bimap.html">MultiIndex
and Bimap</a></dt>
</dl></div>
-<div class="section" lang="en">
+<div class="section" title="The long path from Code Project to Boost">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.history.the_long_path_from_code_project_to_boost"></a><a href="history.html#boost_bimap.history.the_long_path_from_code_project_to_boost" title="The
- long path from Code Project to Boost">The
+<a name="boost_bimap.history.the_long_path_from_code_project_to_boost"></a><a class="link" href="history.html#boost_bimap.history.the_long_path_from_code_project_to_boost" title="The long path from Code Project to Boost">The
long path from Code Project to Boost</a>
</h3></div></div></div>
<div class="variablelist">

Modified: trunk/libs/bimap/doc/html/boost_bimap/history/multiindex_and_bimap.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/history/multiindex_and_bimap.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/history/multiindex_and_bimap.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -1,11 +1,10 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>MultiIndex
- and Bimap</title>
+<title>MultiIndex and Bimap</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../history.html" title="History">
<link rel="prev" href="../history.html" title="History">
<link rel="next" href="../acknowledgements.html" title="Acknowledgements">
@@ -13,20 +12,19 @@
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="../history.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../history.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../acknowledgements.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="MultiIndex and Bimap">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.history.multiindex_and_bimap"></a><a href="multiindex_and_bimap.html" title="MultiIndex
- and Bimap">MultiIndex
+<a name="boost_bimap.history.multiindex_and_bimap"></a><a class="link" href="multiindex_and_bimap.html" title="MultiIndex and Bimap">MultiIndex
 and Bimap</a>
</h3></div></div></div>

@@ -97,8 +95,7 @@



-<pre class="programlisting">
-// Data structure itself
+<pre class="programlisting">// Data structure itself
template<typename ValueType,typename KeyType>
struct Node;
template<typename ValueType,typename KeyType>
@@ -143,8 +140,7 @@



-<pre class="programlisting">
-ptree_gen<string,string>::type PT;
+<pre class="programlisting">ptree_gen<string,string>::type PT;
boost::archive::text_iarchive ia( std::ifstream ifs("filename") );
ia >> PT;
string value = get( "a.b.c.d", PT );
@@ -561,6 +557,7 @@
 
</blockquote></div>
<div class="sidebar">
+

 Specialized containers with Boost.MultiIndex

Modified: trunk/libs/bimap/doc/html/boost_bimap/introduction.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/introduction.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/introduction.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -3,8 +3,8 @@
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>Introduction</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="prev" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="next" href="one_minute_tutorial.html" title="One minute tutorial">
@@ -12,23 +12,23 @@
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="../index.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="one_minute_tutorial.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="Introduction">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="boost_bimap.introduction"></a>Introduction
+<a name="boost_bimap.introduction"></a><a class="link" href="introduction.html" title="Introduction">Introduction</a>
</h2></div></div></div>
<a name="boost_bimap.introduction.how_to_use_this_document"></a><h4>
-<a name="id2568705"></a>
- <a href="introduction.html#boost_bimap.introduction.how_to_use_this_document">How to use
+<a name="id554159"></a>
+ <a class="link" href="introduction.html#boost_bimap.introduction.how_to_use_this_document">How to use
 this document</a>
 </h4>

@@ -43,7 +43,7 @@
 a bidirectional map!</dt>
<dd>
 If your boss will kill you if the project is not finished by the end of
- the day, just read the <a href="one_minute_tutorial.html" title="One minute tutorial">One-minute
+ the day, just read the <a class="link" href="one_minute_tutorial.html" title="One minute tutorial">One-minute
 tutorial</a>. If you have a background in STL, you can be testing a
 bimap within ten minutes.
 </dd>
@@ -51,8 +51,8 @@
 Boost.Bimap</dt>
<dd>
 Boost.Bimap has a lot to offer if you are prepared to spend some time reading
- this documentation. You will need to read <a href="the_tutorial.html" title="The tutorial">The
- tutorial</a> and skim through some of the Examples.
+ this documentation. You will need to read <a class="link" href="the_tutorial.html" title="The tutorial">The
+ tutorial</a> and skim through some of the <a class="link" href="examples.html" title="Examples">Examples</a>.
 The best way to read this documentation is in the order given here. Just
 click on the arrow at the right bottom corner as you finish each page.
 You may skip the reference section, and return to it later to look up a
@@ -73,7 +73,7 @@
 </dd>
</dl>
</div>
-<div class="note"><table border="0" summary="Note">
+<div class="note" title="Note"><table border="0" summary="Note">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../doc/html/images/note.png"></td>
<th align="left">Note</th>
@@ -88,7 +88,7 @@
 and enjoy!
 </td></tr>
</table></div>
-<div class="important"><table border="0" summary="Important">
+<div class="important" title="Important"><table border="0" summary="Important">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Important]" src="../../../../../doc/html/images/important.png"></td>
<th align="left">Important</th>
@@ -102,72 +102,72 @@
 </td></tr>
</table></div>
<a name="boost_bimap.introduction.navigation"></a><h4>
-<a name="id2567618"></a>
- Navigation
+<a name="id554302"></a>
+ <a class="link" href="introduction.html#boost_bimap.introduction.navigation">Navigation</a>
 </h4>

 Used in combination with the configured browser key (usually Alt), the following
 keys act as handy shortcuts for common navigation tasks.
 
-<div class="itemizedlist"><ul type="disc">
-<li>
-General<div class="itemizedlist"><ul type="circle">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+General<div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
<code class="literal">p</code> - Previous page
 </li>
-<li>
+<li class="listitem">
<code class="literal">n</code> - Next page
 </li>
-<li>
+<li class="listitem">
<code class="literal">h</code> - home
 </li>
-<li>
+<li class="listitem">
<code class="literal">u</code> - Up
 </li>
</ul></div>
</li>
-<li>
-Main TOC<div class="itemizedlist"><ul type="circle">
-<li>
+<li class="listitem">
+Main TOC<div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
<code class="literal">i</code> - Introduction
 </li>
-<li>
+<li class="listitem">
<code class="literal">o</code> - One minute tutorial
 </li>
-<li>
+<li class="listitem">
<code class="literal">t</code> - The tutorial
 </li>
-<li>
+<li class="listitem">
<code class="literal">b</code> - Bimap and Boost
 </li>
-<li>
+<li class="listitem">
<code class="literal">r</code> - Reference
 </li>
-<li>
+<li class="listitem">
<code class="literal">c</code> - Compiler specifics
 </li>
-<li>
+<li class="listitem">
<code class="literal">v</code> - Performance
 </li>
-<li>
+<li class="listitem">
<code class="literal">e</code> - Examples
 </li>
-<li>
+<li class="listitem">
<code class="literal">s</code> - Test Suite
 </li>
-<li>
+<li class="listitem">
<code class="literal">f</code> - Future work
 </li>
-<li>
+<li class="listitem">
<code class="literal">m</code> - Release notes
 </li>
-<li>
+<li class="listitem">
<code class="literal">w</code> - Rationale
 </li>
-<li>
+<li class="listitem">
<code class="literal">y</code> - History
 </li>
-<li>
+<li class="listitem">
<code class="literal">a</code> - Acknowledgements
 </li>
</ul></div>

Modified: trunk/libs/bimap/doc/html/boost_bimap/one_minute_tutorial.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/one_minute_tutorial.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/one_minute_tutorial.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -3,8 +3,8 @@
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>One minute tutorial</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="prev" href="introduction.html" title="Introduction">
<link rel="next" href="the_tutorial.html" title="The tutorial">
@@ -12,23 +12,23 @@
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="introduction.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="the_tutorial.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="One minute tutorial">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="boost_bimap.one_minute_tutorial"></a>One minute tutorial
+<a name="boost_bimap.one_minute_tutorial"></a><a class="link" href="one_minute_tutorial.html" title="One minute tutorial">One minute tutorial</a>
</h2></div></div></div>
<a name="boost_bimap.one_minute_tutorial.what_is_a_bimap_"></a><h4>
-<a name="id2567917"></a>
- <a href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.what_is_a_bimap_">What is a
+<a name="id554565"></a>
+ <a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.what_is_a_bimap_">What is a
 bimap?</a>
 </h4>

@@ -46,23 +46,22 @@

 The following code creates an empty bimap container:
 
-<pre class="programlisting">
-typedef bimap<X,Y> bm_type;
+<pre class="programlisting">typedef bimap<X,Y> bm_type;
bm_type bm;
</pre>

 Given this code, the following is the complete description of the resulting
 bimap.
- [<a name="id2614398" href="#ftn.id2614398">1</a>]
+ [<a name="id554727" href="#ftn.id554727" class="footnote">1</a>]
 
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
<code class="computeroutput">bm.left</code> is signature-compatible with <code class="computeroutput">std::map<X,Y></code>
</li>
-<li>
+<li class="listitem">
<code class="computeroutput">bm.right</code> is signature-compatible with <code class="computeroutput">std::map<Y,X></code>
</li>
-<li>
+<li class="listitem">
<code class="computeroutput">bm</code> is signature-compatible
 with <code class="computeroutput">std::set< relation<X,Y> ></code>
</li>
@@ -77,8 +76,7 @@

 If we have any generic function that work with maps
 
-<pre class="programlisting">
-template< class MapType >
+<pre class="programlisting">template< class MapType >
void print_map(const MapType & m)
{
 typedef typename MapType::const_iterator const_iterator;
@@ -92,8 +90,7 @@
 We can use the left map view and the right map
 view with it
 
-<pre class="programlisting">
-bimap< int, std::string > bm;
+<pre class="programlisting">bimap< int, std::string > bm;
...
print_map( bm.left );
print_map( bm.right );
@@ -109,8 +106,8 @@
...
</pre>
<a name="boost_bimap.one_minute_tutorial.layout_of_the_relation_and_the_pairs_of_a_bimap"></a><h4>
-<a name="id2615163"></a>
- <a href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.layout_of_the_relation_and_the_pairs_of_a_bimap">Layout
+<a name="id555399"></a>
+ <a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.layout_of_the_relation_and_the_pairs_of_a_bimap">Layout
 of the relation and the pairs of a bimap</a>
 </h4>

@@ -123,14 +120,13 @@
 <img src="../images/bimap/relation.and.pair.png" alt="relation.and.pair">
 
<a name="boost_bimap.one_minute_tutorial.step_by_step"></a><h4>
-<a name="id2615242"></a>
- Step by step
+<a name="id555466"></a>
+ <a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.step_by_step">Step by step</a>
 </h4>

 A convinience header is avaiable in the boost directory:
 
-<pre class="programlisting">
-#include <boost/bimap.hpp>
+<pre class="programlisting">#include <boost/bimap.hpp>
</pre>

 Lets define a bidirectional map between integers and strings:
@@ -140,8 +136,7 @@



-<pre class="programlisting">
-typedef boost::bimap< int, std::string > bm_type;
+<pre class="programlisting">typedef boost::bimap< int, std::string > bm_type;
bm_type bm;
</pre>

@@ -149,8 +144,8 @@

 
<a name="boost_bimap.one_minute_tutorial.the_collection_of_relations_view"></a><h4>
-<a name="id2615413"></a>
- <a href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.the_collection_of_relations_view">The
+<a name="id555616"></a>
+ <a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.the_collection_of_relations_view">The
 collection of relations view</a>
 </h4>

@@ -163,8 +158,7 @@



-<pre class="programlisting">
-bm.insert( bm_type::value_type(1, "one" ) );
+<pre class="programlisting">bm.insert( bm_type::value_type(1, "one" ) );
bm.insert( bm_type::value_type(2, "two" ) );

std::cout << "There are " << bm.size() << "relations" << std::endl;
@@ -183,8 +177,8 @@

 
<a name="boost_bimap.one_minute_tutorial.the_left_map_view"></a><h4>
-<a name="id2615920"></a>
- <a href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.the_left_map_view">The left
+<a name="id556065"></a>
+ <a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.the_left_map_view">The left
 map view</a>
 </h4>

@@ -198,8 +192,7 @@



-<pre class="programlisting">
-<a name="boost_bimap0co" href="one_minute_tutorial.html#boost_bimap0"><img src="../images/callouts/1.png" alt="1" border="0"></a>typedef bm_type::left_map::const_iterator left_const_iterator;
+<pre class="programlisting"><a class="co" name="boost_bimap0co" href="one_minute_tutorial.html#boost_bimap0"><img src="../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>typedef bm_type::left_map::const_iterator left_const_iterator;

for( left_const_iterator left_iter = bm.left.begin(), iend = bm.left.end();
 left_iter != iend; ++left_iter )
@@ -210,10 +203,10 @@
 std::cout << left_iter->first << " --> " << left_iter->second << std::endl;
}

-<a name="boost_bimap1co" href="one_minute_tutorial.html#boost_bimap1"><img src="../images/callouts/2.png" alt="2" border="0"></a>bm_type::left_const_iterator left_iter = bm.left.find(2);
+<a class="co" name="boost_bimap1co" href="one_minute_tutorial.html#boost_bimap1"><img src="../../../../../doc/src/images/callouts/2.png" alt="2" border="0"></a>bm_type::left_const_iterator left_iter = bm.left.find(2);
assert( left_iter->second == "two" );

-<a name="boost_bimap2co" href="one_minute_tutorial.html#boost_bimap2"><img src="../images/callouts/3.png" alt="3" border="0"></a>bm.left.insert( bm_type::left_value_type( 3, "three" ) );
+<a class="co" name="boost_bimap2co" href="one_minute_tutorial.html#boost_bimap2"><img src="../../../../../doc/src/images/callouts/3.png" alt="3" border="0"></a>bm.left.insert( bm_type::left_value_type( 3, "three" ) );
</pre>

 
@@ -223,21 +216,18 @@
 
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
-<td width="5%" valign="top" align="left">
-<a name="boost_bimap0"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap0"></a> </td>
<td valign="top" align="left"> The type of <code class="computeroutput">bm.left</code> is <code class="computeroutput">bm_type::left_map</code>
 and the type of <code class="computeroutput">bm.right</code> is <code class="computeroutput">bm_type::right_map</code>
 </td>
</tr>
<tr>
-<td width="5%" valign="top" align="left">
-<a name="boost_bimap1"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap1"></a> </td>
<td valign="top" align="left"> <code class="computeroutput">bm_type::left_</code>-type- can be used as a shortcut for
 the more verbose <code class="computeroutput">bm_type::left_map::</code>-type- </td>
</tr>
<tr>
-<td width="5%" valign="top" align="left">
-<a name="boost_bimap2"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap2"></a> </td>
<td valign="top" align="left"> This line produces the same effect
 of <code class="computeroutput">bm.insert( bm_type::value_type(3,"three") );</code> </td>
</tr>
@@ -247,8 +237,8 @@

 
<a name="boost_bimap.one_minute_tutorial.the_right_map_view"></a><h4>
-<a name="id2616766"></a>
- <a href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.the_right_map_view">The right
+<a name="id556790"></a>
+ <a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.the_right_map_view">The right
 map view</a>
 </h4>

@@ -262,8 +252,7 @@



-<pre class="programlisting">
-bm_type::right_const_iterator right_iter = bm.right.find("two");
+<pre class="programlisting">bm_type::right_const_iterator right_iter = bm.right.find("two");

// right_iter->first : key : std::string
// right_iter->second : data : int
@@ -274,7 +263,7 @@

bm.right.erase("two");

-<a name="boost_bimap3co" href="one_minute_tutorial.html#boost_bimap3"><img src="../images/callouts/1.png" alt="1" border="0"></a>bm.right.insert( bm_type::right_value_type( "four", 4 ) );
+<a class="co" name="boost_bimap3co" href="one_minute_tutorial.html#boost_bimap3"><img src="../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>bm.right.insert( bm_type::right_value_type( "four", 4 ) );
</pre>

 
@@ -283,8 +272,7 @@

 
<div class="calloutlist"><table border="0" summary="Callout list"><tr>
-<td width="5%" valign="top" align="left">
-<a name="boost_bimap3"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap3"></a> </td>
<td valign="top" align="left"> This line produces the same effect of <code class="computeroutput">bm.insert( bm_type::value_type(4,"four")
 );</code> </td>
</tr></table></div>
@@ -293,8 +281,8 @@

 
<a name="boost_bimap.one_minute_tutorial.differences_with_std__map"></a><h4>
-<a name="id2617268"></a>
- <a href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.differences_with_std__map">Differences
+<a name="id557230"></a>
+ <a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.differences_with_std__map">Differences
 with std::map</a>
 </h4>

@@ -307,16 +295,14 @@
 However dereferencing a <code class="computeroutput">bimap<X,Y>::left_iterator</code>
 returns a type that is signature-compatible with a <code class="computeroutput">std::pair<const X, const Y></code>
 
-<pre class="programlisting">
-bm.left.find(1)->second = "1"; // Compilation error
+<pre class="programlisting">bm.left.find(1)->second = "1"; // Compilation error
</pre>

 If you insert <code class="computeroutput">(1,"one")</code> and <code class="computeroutput">(1,"1")</code> in a <code class="computeroutput">std::map<int,std::string></code> the second insertion will have no effect.
 In a <code class="computeroutput">bimap<X,Y></code> both keys have to remain unique. The insertion
 may fail in other situtions too. Lets see an example
 
-<pre class="programlisting">
-bm.clear();
+<pre class="programlisting">bm.clear();

bm.insert( bm_type::value_type( 1, "one" ) );

@@ -326,8 +312,8 @@
assert( bm.size() == 1 );
</pre>
<a name="boost_bimap.one_minute_tutorial.a_simple_example"></a><h4>
-<a name="id2618024"></a>
- A simple example
+<a name="id557889"></a>
+ <a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.a_simple_example">A simple example</a>
 </h4>

 Look how you can reuse code that is intend to be used with std::maps, like
@@ -341,8 +327,7 @@



-<pre class="programlisting">
-#include <string>
+<pre class="programlisting">#include <string>
#include <iostream>

#include <boost/bimap.hpp>
@@ -423,16 +408,16 @@
<code class="literal">Spain ends in position 2</code>
</pre>
<a name="boost_bimap.one_minute_tutorial.continuing_the_journey"></a><h4>
-<a name="id2619457"></a>
- <a href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.continuing_the_journey">Continuing
+<a name="id559435"></a>
+ <a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.continuing_the_journey">Continuing
 the journey</a>
 </h4>

 For information on function signatures, see any standard library documentation
- or read the reference section
+ or read the <a class="link" href="reference.html" title="Reference">reference</a> section
 of this documentation.
 
-<div class="caution"><table border="0" summary="Caution">
+<div class="caution" title="Caution"><table border="0" summary="Caution">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Caution]" src="../../../../../doc/html/images/caution.png"></td>
<th align="left">Caution</th>
@@ -443,13 +428,13 @@
 of inserting a pair into the left map where the second value conflicts with
 a stored relation in the container. The functions may be slower in a bimap
 because of the duplicated constraints. It is strongly recommended that you
- read The full tutorial if
+ read <a class="link" href="the_tutorial.html" title="The tutorial">The full tutorial</a> if
 you intend to use a bimap in a serious project.
 </td></tr>
</table></div>
<div class="footnotes">
 <hr width="100" align="left">
-<div class="footnote">[<a name="ftn.id2614398" href="#id2614398">1</a>] 
+<div class="footnote">[<a name="ftn.id554727" href="#id554727" class="para">1</a>] 
 A type is signature-compatible with other type if
 it has the same signature for functions and metadata. Preconditions, postconditions
 and the order of operations need not be the same.

Modified: trunk/libs/bimap/doc/html/boost_bimap/performance.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/performance.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/performance.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -3,8 +3,8 @@
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>Performance</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="prev" href="compiler_specifics.html" title="Compiler specifics">
<link rel="next" href="examples.html" title="Examples">
@@ -12,19 +12,19 @@
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="compiler_specifics.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="examples.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="Performance">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="boost_bimap.performance"></a>Performance
+<a name="boost_bimap.performance"></a><a class="link" href="performance.html" title="Performance">Performance</a>
</h2></div></div></div>

Section under construction.

Modified: trunk/libs/bimap/doc/html/boost_bimap/rationale.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/rationale.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/rationale.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -3,29 +3,28 @@
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>Rationale</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="prev" href="release_notes.html" title="Release notes">
-<link rel="next" href="rationale/additional_features.html" title="Additional
- Features">
+<link rel="next" href="rationale/additional_features.html" title="Additional Features">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="release_notes.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="rationale/additional_features.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="Rationale">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="boost_bimap.rationale"></a>Rationale
+<a name="boost_bimap.rationale"></a><a class="link" href="rationale.html" title="Rationale">Rationale</a>
</h2></div></div></div>
<div class="toc"><dl>
<dt>General Design</dt>
@@ -47,7 +46,7 @@
 of email flowed between Joaquin and Matias. The juiciest parts of the conversations
 where extracted and rearranged here.
 
-<div class="note"><table border="0" summary="Note">
+<div class="note" title="Note"><table border="0" summary="Note">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../doc/html/images/note.png"></td>
<th align="left">Note</th>
@@ -58,9 +57,9 @@
 at developers.
 </td></tr>
</table></div>
-<div class="section" lang="en">
+<div class="section" title="General Design">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.rationale.general_design"></a>General Design
+<a name="boost_bimap.rationale.general_design"></a><a class="link" href="rationale.html#boost_bimap.rationale.general_design" title="General Design">General Design</a>
</h3></div></div></div>

 The initial explanation includes few features. This section aims to describe
@@ -80,8 +79,7 @@
 The following interface is necessary for the <code class="literal">relation</code>
 class:
 
-<pre class="programlisting">
-typedef -unspecified- TA; typedef -unspecified- TB;
+<pre class="programlisting">typedef -unspecified- TA; typedef -unspecified- TB;

TA a, ai; TB b, bi;

@@ -133,16 +131,16 @@
 is very simple, and it is based heavily on the concepts of the STL. Given
 a <code class="computeroutput">bimap<A,B> bm</code>:
 
-<div class="orderedlist"><ol type="1">
-<li>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
<code class="computeroutput">bm.left</code> is signature-compatible with a
 <code class="computeroutput">std::map<A,B></code>
</li>
-<li>
+<li class="listitem">
<code class="computeroutput">bm.right</code> is signature-compatible with a
 <code class="computeroutput">std::map<B,A></code>
</li>
-<li>
+<li class="listitem">
<code class="computeroutput">bm</code> is signature-compatible
 with a <code class="computeroutput">std::set<relation<A,B> ></code>
</li>
@@ -155,8 +153,8 @@
 as being simple and powerful. This is the general design.
 
<a name="boost_bimap.rationale.general_design.relation_implementation"></a><h5>
-<a name="id2728654"></a>
- <a href="rationale.html#boost_bimap.rationale.general_design.relation_implementation">Relation
+<a name="id666407"></a>
+ <a class="link" href="rationale.html#boost_bimap.rationale.general_design.relation_implementation">Relation
 Implementation</a>
 </h5>

@@ -170,8 +168,7 @@
 has two references named first and second that bind to <code class="computeroutput">A</code>
 and <code class="computeroutput">B</code>, or to <code class="computeroutput">B</code> and <code class="computeroutput">A</code>.
 
-<pre class="programlisting">
-relation<TA,TB> r;
+<pre class="programlisting">relation<TA,TB> r;

const_reference_pair<A,B> pba(r);
const_reference_pair<B,A> pbb(r);
@@ -196,8 +193,7 @@
 clause that is not currently in the standard but is very natural. The additional
 clause imposes that if we have two classes:
 
-<pre class="programlisting">
-struct class_a_b
+<pre class="programlisting">struct class_a_b
{
 Type1 name_a;
 Type2 name_b;
@@ -246,7 +242,7 @@
 both cases, because we require that the same code be compilable by any standards-compliant
 compiler.
 
-<div class="note"><table border="0" summary="Note">
+<div class="note" title="Note"><table border="0" summary="Note">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../doc/html/images/note.png"></td>
<th align="left">Note</th>
@@ -258,8 +254,8 @@
 </td></tr>
</table></div>
<a name="boost_bimap.rationale.general_design.bimap_implementation"></a><h5>
-<a name="id2729244"></a>
- <a href="rationale.html#boost_bimap.rationale.general_design.bimap_implementation">Bimap
+<a name="id666981"></a>
+ <a class="link" href="rationale.html#boost_bimap.rationale.general_design.bimap_implementation">Bimap
 Implementation</a>
 </h5>

Modified: trunk/libs/bimap/doc/html/boost_bimap/rationale/additional_features.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/rationale/additional_features.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/rationale/additional_features.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -1,11 +1,10 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Additional
- Features</title>
+<title>Additional Features</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../rationale.html" title="Rationale">
<link rel="prev" href="../rationale.html" title="Rationale">
<link rel="next" href="code.html" title="Code">
@@ -13,25 +12,24 @@
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="../rationale.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="code.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="Additional Features">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.rationale.additional_features"></a><a href="additional_features.html" title="Additional
- Features">Additional
+<a name="boost_bimap.rationale.additional_features"></a><a class="link" href="additional_features.html" title="Additional Features">Additional
 Features</a>
</h3></div></div></div>
<a name="boost_bimap.rationale.additional_features.n_1__n_n__hashed_maps"></a><h5>
-<a name="id2729533"></a>
- <a href="additional_features.html#boost_bimap.rationale.additional_features.n_1__n_n__hashed_maps">N-1,
+<a name="id667261"></a>
+ <a class="link" href="additional_features.html#boost_bimap.rationale.additional_features.n_1__n_n__hashed_maps">N-1,
 N-N, hashed maps</a>
 </h5>

@@ -42,12 +40,12 @@
 collection type of each key directly. In order to implement this feature,
 we have to solve two problems:
 
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 The index types of the <code class="computeroutput">multi_index_container</code>
 core now depends on the collection type used for each key.
 </li>
-<li>
+<li class="listitem">
 The map views now change their semantics according to the collection type
 chosen.
 </li>
@@ -62,8 +60,8 @@
 <img src="../../images/bimap/bimap.structures.png" alt="bimap.structures">
 
<a name="boost_bimap.rationale.additional_features.collection_type_of_relation_constraints"></a><h5>
-<a name="id2729641"></a>
- <a href="additional_features.html#boost_bimap.rationale.additional_features.collection_type_of_relation_constraints">Collection
+<a name="id667368"></a>
+ <a class="link" href="additional_features.html#boost_bimap.rationale.additional_features.collection_type_of_relation_constraints">Collection
 type of relation constraints</a>
 </h5>

@@ -74,29 +72,29 @@
 bases the collection type of relations on the left collection type, but the
 user may choose between:
 
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 left_based
 </li>
-<li>
+<li class="listitem">
 right_based
 </li>
-<li>
+<li class="listitem">
 set_of_relation<>
 </li>
-<li>
+<li class="listitem">
 multiset_of_relation<>
 </li>
-<li>
+<li class="listitem">
 unordered_set_of_relation<>
 </li>
-<li>
+<li class="listitem">
 unordered_multiset_of_relation<>
 </li>
-<li>
+<li class="listitem">
 list_of
 </li>
-<li>
+<li class="listitem">
 vector_of
 </li>
</ul></div>
@@ -106,8 +104,8 @@
 uses further metaprogramming to define a new index if necessary.
 
<a name="boost_bimap.rationale.additional_features.tagged"></a><h5>
-<a name="id2729729"></a>
- Tagged
+<a name="id667455"></a>
+ <a class="link" href="additional_features.html#boost_bimap.rationale.additional_features.tagged">Tagged</a>
 </h5>

 The idea of using tags instead of the <code class="literal">member_at::side</code>

Modified: trunk/libs/bimap/doc/html/boost_bimap/rationale/code.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/rationale/code.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/rationale/code.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -3,30 +3,28 @@
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>Code</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../rationale.html" title="Rationale">
-<link rel="prev" href="additional_features.html" title="Additional
- Features">
-<link rel="next" href="the_student_and_the_mentor.html" title="The
- student and the mentor">
+<link rel="prev" href="additional_features.html" title="Additional Features">
+<link rel="next" href="the_student_and_the_mentor.html" title="The student and the mentor">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="additional_features.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="the_student_and_the_mentor.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="Code">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.rationale.code"></a>Code
+<a name="boost_bimap.rationale.code"></a><a class="link" href="code.html" title="Code">Code</a>
</h3></div></div></div>

 You can browse the code using the Boost.Bimap doxygen docs.
@@ -36,7 +34,7 @@
 Library Requirement and Guidelines</a> as closely as possible.
 
<div class="table">
-<a name="id2729843"></a>Table 1.10. folders in boost/bimap
+<a name="id667570"></a>Table 1.10. folders in boost/bimap
<div class="table-contents"><table class="table" summary="folders in boost/bimap">
<colgroup>
<col>
@@ -127,7 +125,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id2729974"></a>Table 1.11. folders in each folder
+<a name="id667700"></a>Table 1.11. folders in each folder
<div class="table-contents"><table class="table" summary="folders in each folder">
<colgroup>
<col>

Modified: trunk/libs/bimap/doc/html/boost_bimap/rationale/the_student_and_the_mentor.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/rationale/the_student_and_the_mentor.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/rationale/the_student_and_the_mentor.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -1,11 +1,10 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>The
- student and the mentor</title>
+<title>The student and the mentor</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../rationale.html" title="Rationale">
<link rel="prev" href="code.html" title="Code">
<link rel="next" href="../history.html" title="History">
@@ -13,23 +12,22 @@
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="code.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../history.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="The student and the mentor">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.rationale.the_student_and_the_mentor"></a><a href="the_student_and_the_mentor.html" title="The
- student and the mentor">The
+<a name="boost_bimap.rationale.the_student_and_the_mentor"></a><a class="link" href="the_student_and_the_mentor.html" title="The student and the mentor">The
 student and the mentor</a>
</h3></div></div></div>
-<div class="tip"><table border="0" summary="Tip">
+<div class="tip" title="Tip"><table border="0" summary="Tip">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Tip]" src="../../../../../../doc/html/images/tip.png"></td>
<th align="left">Tip</th>
@@ -753,8 +751,7 @@



-<pre class="programlisting">
-relation<TA,TB> r;
+<pre class="programlisting">relation<TA,TB> r;
const_reference_pair<A,B> pba(r);
const_reference_pair<B,A> pbb(r);
</pre>
@@ -1294,8 +1291,7 @@



-<pre class="programlisting">
-map_view x=...;
+<pre class="programlisting">map_view x=...;
map_view y=...;
x=y;
</pre>

Modified: trunk/libs/bimap/doc/html/boost_bimap/reference.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/reference.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/reference.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -3,8 +3,8 @@
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>Reference</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="prev" href="bimap_and_boost/dependencies.html" title="Dependencies">
<link rel="next" href="reference/bimap_reference.html" title="Bimap Reference">
@@ -12,19 +12,19 @@
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="bimap_and_boost/dependencies.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference/bimap_reference.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="Reference">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="boost_bimap.reference"></a>Reference
+<a name="boost_bimap.reference"></a><a class="link" href="reference.html" title="Reference">Reference</a>
</h2></div></div></div>
<div class="toc"><dl>
<dt>Headers</dt>
@@ -89,9 +89,9 @@
 Views</a></dt>
</dl></dd>
</dl></div>
-<div class="section" lang="en">
+<div class="section" title="Headers">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.reference.headers"></a>Headers
+<a name="boost_bimap.reference.headers"></a><a class="link" href="reference.html#boost_bimap.reference.headers" title="Headers">Headers</a>
</h3></div></div></div>

 The following are the interface headers of Boost.Bimap:
@@ -99,54 +99,54 @@

 Convenience
 
-<div class="itemizedlist"><ul type="disc"><li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
 "boost/bimap.hpp" (includes "boost/bimap/bimap.hpp"
 and imports the bimap class to boost namespace)
</li></ul></div>

 Container
 
-<div class="itemizedlist"><ul type="disc"><li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
 "boost/bimap/bimap.hpp" (includes "boost/bimap/set_of.hpp"
 and "boost/bimap/unconstrained_set_of.hpp")
</li></ul></div>

 Set Types
 
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 "boost/bimap/set_of.hpp"
 </li>
-<li>
+<li class="listitem">
 "boost/bimap/multiset_of.hpp"
 </li>
-<li>
+<li class="listitem">
 "boost/bimap/unordered_set_of.hpp"
 </li>
-<li>
+<li class="listitem">
 "boost/bimap/unordered_multiset_of.hpp"
 </li>
-<li>
+<li class="listitem">
 "boost/bimap/list_of.hpp"
 </li>
-<li>
+<li class="listitem">
 "boost/bimap/vector_of.hpp"
 </li>
-<li>
+<li class="listitem">
 "boost/bimap/unconstrained_set_of.hpp"
 </li>
</ul></div>

 Boost Integration
 
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 "boost/bimap/support/lambda.hpp"
 </li>
-<li>
+<li class="listitem">
 "boost/bimap/property_map/set_support.hpp"
 </li>
-<li>
+<li class="listitem">
 "boost/bimap/property_map/unordered_set_support.hpp"
 </li>
</ul></div>

Modified: trunk/libs/bimap/doc/html/boost_bimap/reference/bimap_reference.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/reference/bimap_reference.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/reference/bimap_reference.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -3,8 +3,8 @@
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>Bimap Reference</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../reference.html" title="Reference">
<link rel="prev" href="../reference.html" title="Reference">
<link rel="next" href="set_of_reference.html" title="set_of Reference">
@@ -12,19 +12,19 @@
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="../reference.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="set_of_reference.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="Bimap Reference">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.reference.bimap_reference"></a>Bimap Reference
+<a name="boost_bimap.reference.bimap_reference"></a><a class="link" href="bimap_reference.html" title="Bimap Reference">Bimap Reference</a>
</h3></div></div></div>
<div class="toc"><dl>
<dt><a href="bimap_reference.html#boost_bimap.reference.bimap_reference.view_concepts">View
@@ -53,10 +53,9 @@
<dt>Serialization</dt>
</dl></dd>
</dl></div>
-<div class="section" lang="en">
+<div class="section" title="View concepts">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.reference.bimap_reference.view_concepts"></a><a href="bimap_reference.html#boost_bimap.reference.bimap_reference.view_concepts" title="View
- concepts">View
+<a name="boost_bimap.reference.bimap_reference.view_concepts"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.view_concepts" title="View concepts">View
 concepts</a>
</h4></div></div></div>

@@ -80,25 +79,25 @@
 (such as uniqueness of elements). The global operations performed jointly
 in the any view can be reduced to six primitives:
 
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 copying
 </li>
-<li>
+<li class="listitem">
 insertion of an element
 </li>
-<li>
+<li class="listitem">
 hinted insertion, where a pre-existing element is suggested in order
 to improve the efficiency of the operation
 </li>
-<li>
+<li class="listitem">
 deletion of an element
 </li>
-<li>
+<li class="listitem">
 replacement of the value of an element, which may trigger the rearrangement
 of this element in one or more views, or may forbid the replacement
 </li>
-<li>
+<li class="listitem">
 modification of an element, and its subsequent rearrangement/banning
 by the various views
 </li>
@@ -114,10 +113,9 @@
</div>
<a name="complexity_signature_explanation"></a>
 
-<div class="section" lang="en">
+<div class="section" title="Complexity signature">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.reference.bimap_reference.complexity_signature"></a><a href="bimap_reference.html#boost_bimap.reference.bimap_reference.complexity_signature" title="Complexity
- signature">Complexity
+<a name="boost_bimap.reference.bimap_reference.complexity_signature"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.complexity_signature" title="Complexity signature">Complexity
 signature</a>
</h4></div></div></div>

@@ -131,28 +129,28 @@
 its complexity signature, consisting of the following associated functions
 on the number of elements:
 
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
<code class="computeroutput">c(n)</code>:
 copying
 </li>
-<li>
+<li class="listitem">
<code class="computeroutput">i(n)</code>:
 insertion
 </li>
-<li>
+<li class="listitem">
<code class="computeroutput">h(n)</code>:
 hinted insertion
 </li>
-<li>
+<li class="listitem">
<code class="computeroutput">d(n)</code>:
 deletion
 </li>
-<li>
+<li class="listitem">
<code class="computeroutput">r(n)</code>:
 replacement
 </li>
-<li>
+<li class="listitem">
<code class="computeroutput">m(n)</code>:
 modifying
 </li>
@@ -170,25 +168,24 @@
 to denote the above view, the complexity of insertion will now be <code class="computeroutput">O(i_l(n)+i_r(n)+i_a(n))</code>.
 To abbreviate the notation, we adopt the following definitions:
 
-<div class="itemizedlist"><ul type="disc">
-<li><code class="computeroutput">C(n) = c_l(n) + c_r(n) [ +
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem"><code class="computeroutput">C(n) = c_l(n) + c_r(n) [ +
 c_a(n) ]</code></li>
-<li><code class="computeroutput">I(n) = i_l(n) + i_r(n) [ +
+<li class="listitem"><code class="computeroutput">I(n) = i_l(n) + i_r(n) [ +
 i_a(n) ]</code></li>
-<li><code class="computeroutput">H(n) = h_l(n) + h_r(n) [ +
+<li class="listitem"><code class="computeroutput">H(n) = h_l(n) + h_r(n) [ +
 h_a(n) ]</code></li>
-<li><code class="computeroutput">D(n) = d_l(n) + d_r(n) [ +
+<li class="listitem"><code class="computeroutput">D(n) = d_l(n) + d_r(n) [ +
 d_a(n) ]</code></li>
-<li><code class="computeroutput">R(n) = r_l(n) + r_r(n) [ +
+<li class="listitem"><code class="computeroutput">R(n) = r_l(n) + r_r(n) [ +
 r_a(n) ]</code></li>
-<li><code class="computeroutput">M(n) = m_l(n) + m_r(n) [ +
+<li class="listitem"><code class="computeroutput">M(n) = m_l(n) + m_r(n) [ +
 m_a(n) ]</code></li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Set type specification">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.reference.bimap_reference.set_type_specification"></a><a href="bimap_reference.html#boost_bimap.reference.bimap_reference.set_type_specification" title="Set
- type specification">Set
+<a name="boost_bimap.reference.bimap_reference.set_type_specification"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.set_type_specification" title="Set type specification">Set
 type specification</a>
</h4></div></div></div>

@@ -380,9 +377,9 @@
</tbody>
</table></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Tags">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.reference.bimap_reference.tags"></a>Tags
+<a name="boost_bimap.reference.bimap_reference.tags"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.tags" title="Tags">Tags</a>
</h4></div></div></div>

 Tags are just conventional types used as mnemonics for the types stored
@@ -390,14 +387,12 @@
 uses the tagged idiom to let the user specify this tags.
 
</div>
-<div class="section" lang="en">
+<div class="section" title='Header "boost/bimap/bimap.hpp" synopsis'>
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.reference.bimap_reference.header__boost_bimap_bimap_hpp__synopsis"></a><a href="bimap_reference.html#boost_bimap.reference.bimap_reference.header__boost_bimap_bimap_hpp__synopsis" title='Header
- "boost/bimap/bimap.hpp" synopsis'>Header
+<a name="boost_bimap.reference.bimap_reference.header__boost_bimap_bimap_hpp__synopsis"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.header__boost_bimap_bimap_hpp__synopsis" title='Header "boost/bimap/bimap.hpp" synopsis'>Header
 "boost/bimap/bimap.hpp" synopsis</a>
</h4></div></div></div>
-<pre class="programlisting">
-namespace boost {
+<pre class="programlisting">namespace boost {
namespace bimaps {

template< class Type, typename Tag >
@@ -489,10 +484,9 @@
} // namespace boost
</pre>
</div>
-<div class="section" lang="en">
+<div class="section" title="Class template bimap">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.reference.bimap_reference.class_template_bimap"></a><a href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap" title="Class
- template bimap">Class
+<a name="boost_bimap.reference.bimap_reference.class_template_bimap"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap" title="Class template bimap">Class
 template bimap</a>
</h4></div></div></div>
<div class="toc"><dl>
@@ -512,52 +506,49 @@

 This is the main component of Boost.Bimap.
 
-<div class="section" lang="en">
+<div class="section" title="Complexity">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.bimap_reference.class_template_bimap.complexity"></a>Complexity
+<a name="boost_bimap.reference.bimap_reference.class_template_bimap.complexity"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.complexity" title="Complexity">Complexity</a>
</h5></div></div></div>

 In the descriptions of the operations of <code class="computeroutput">bimap</code>,
 we adopt the scheme outlined in the complexity signature section.
 
</div>
-<div class="section" lang="en">
+<div class="section" title="Instantiation types">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.bimap_reference.class_template_bimap.instantiation_types"></a><a href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.instantiation_types" title="Instantiation
- types">Instantiation
+<a name="boost_bimap.reference.bimap_reference.class_template_bimap.instantiation_types"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.instantiation_types" title="Instantiation types">Instantiation
 types</a>
</h5></div></div></div>

 <code class="computeroutput">bimap</code> is instantiated
 with the following types:
 
-<div class="orderedlist"><ol type="1">
-<li>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
 LeftCollectionType and RightCollectionType are collection type specifications
 optionally tagged, or any type optionally tagged, in which case that
 side acts as a set.
 </li>
-<li>
+<li class="listitem">
 AdditionalParameter_{1/2} can be any ordered subset of:
- <div class="itemizedlist"><ul type="disc">
-<li>
+ <div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 CollectionTypeOfRelation specification
 </li>
-<li>
+<li class="listitem">
 Allocator
 </li>
</ul></div>
</li>
</ol></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Nested types">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.bimap_reference.class_template_bimap.nested_types"></a><a href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.nested_types" title="Nested
- types">Nested
+<a name="boost_bimap.reference.bimap_reference.class_template_bimap.nested_types"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.nested_types" title="Nested types">Nested
 types</a>
</h5></div></div></div>
-<pre class="programlisting">
-left_tag, right_tag
+<pre class="programlisting">left_tag, right_tag
</pre>
<div class="blockquote"><blockquote class="blockquote">

@@ -570,8 +561,7 @@

 
</blockquote></div>
-<pre class="programlisting">
-left_key_type, right_key_type
+<pre class="programlisting">left_key_type, right_key_type
</pre>
<div class="blockquote"><blockquote class="blockquote">

@@ -584,8 +574,7 @@

 
</blockquote></div>
-<pre class="programlisting">
-left_data_type, right_data_type
+<pre class="programlisting">left_data_type, right_data_type
</pre>
<div class="blockquote"><blockquote class="blockquote">

@@ -598,8 +587,7 @@

 
</blockquote></div>
-<pre class="programlisting">
-left_value_type, right_value_type
+<pre class="programlisting">left_value_type, right_value_type
</pre>
<div class="blockquote"><blockquote class="blockquote">

@@ -611,8 +599,7 @@

 
</blockquote></div>
-<pre class="programlisting">
-left_iterator, right_iterator
+<pre class="programlisting">left_iterator, right_iterator
left_const_iterator, right_const_iterator
</pre>
<div class="blockquote"><blockquote class="blockquote">
@@ -625,8 +612,7 @@

 
</blockquote></div>
-<pre class="programlisting">
-left_map, right_map
+<pre class="programlisting">left_map, right_map
</pre>
<div class="blockquote"><blockquote class="blockquote">

@@ -639,98 +625,92 @@
 
</blockquote></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Constructors, copy and assignment">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.bimap_reference.class_template_bimap.constructors__copy_and_assignment"></a><a href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.constructors__copy_and_assignment" title="Constructors,
- copy and assignment">Constructors,
+<a name="boost_bimap.reference.bimap_reference.class_template_bimap.constructors__copy_and_assignment"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.constructors__copy_and_assignment" title="Constructors, copy and assignment">Constructors,
 copy and assignment</a>
</h5></div></div></div>
-<pre class="programlisting">
-bimap();
+<pre class="programlisting">bimap();
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: Constructs an empty <code class="computeroutput">bimap</code>.
 </li>
-<li>
+<li class="listitem">
Complexity: Constant.
 </li>
</ul></div>
-<pre class="programlisting">
-template<typename InputIterator>
+<pre class="programlisting">template<typename InputIterator>
bimap(InputIterator first,InputIterator last);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">InputIterator</code>
 is a model of Input Iterator over elements of type <code class="computeroutput">relation</code>
 or a type convertible to <code class="computeroutput">relation</code>.
 last is reachable from <code class="computeroutput">first</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Constructs an empty <code class="computeroutput">bimap</code> and fills it with the elements
 in the range <code class="computeroutput">[first,last)</code>. Insertion of each element may or
 may not succeed depending on acceptance by the collection types of
 the <code class="computeroutput">bimap</code>.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="bimap_reference.html#complexity_signature_explanation">Complexity:</a>
 O(m*H(m)), where m is the number of elements in <code class="computeroutput">[first,last)</code>.
 </li>
</ul></div>
-<pre class="programlisting">
-bimap(const bimap & x);
+<pre class="programlisting">bimap(const bimap & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: Constructs a copy of x, copying
 its elements as well as its internal objects (key extractors, comparison
 objects, allocator.)
 </li>
-<li>
+<li class="listitem">
Postconditions:<code class="computeroutput">*this == x</code>. The order of the views of the
 <code class="computeroutput">bimap</code> is preserved
 as well.
 </li>
-<li>
+<li class="listitem">
Complexity: O(x.size()*log(x.size())
 + C(x.size()))
 </li>
</ul></div>
-<pre class="programlisting">
-~bimap()
+<pre class="programlisting">~bimap()
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: Destroys the <code class="computeroutput">bimap</code> and all the elements contained.
 The order in which the elements are destroyed is not specified.
 </li>
-<li>
+<li class="listitem">
Complexity: O(n).
 </li>
</ul></div>
-<pre class="programlisting">
-bimap& operator=(const bimap& x);
+<pre class="programlisting">bimap& operator=(const bimap& x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: Replaces the elements and
 internal objects of the <code class="computeroutput">bimap</code>
 with copies from x.
 </li>
-<li>
+<li class="listitem">
Postconditions:<code class="computeroutput">*this==x</code>. The order on the views of the
 <code class="computeroutput">bimap</code> is preserved
 as well.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">*this</code>.
 </li>
-<li>
+<li class="listitem">
Complexity: O(n + x.size()*log(x.size())
 + C(x.size())).
 </li>
-<li>
+<li class="listitem">
Exception safety: Strong, provided
 the copy and assignment operations of the types of <code class="computeroutput">ctor_args_list</code>
 do not throw.
@@ -739,10 +719,9 @@
</div>
<a name="reference_projection_operations"></a>
 
-<div class="section" lang="en">
+<div class="section" title="Projection operations">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.bimap_reference.class_template_bimap.projection_operations"></a><a href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.projection_operations" title="Projection
- operations">Projection
+<a name="boost_bimap.reference.bimap_reference.class_template_bimap.projection_operations"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.projection_operations" title="Projection operations">Projection
 operations</a>
</h5></div></div></div>

@@ -750,167 +729,160 @@
 v1 and v2, we say than an v1-iterator it1 and an v2-iterator it2 are
 equivalent if:
 
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
<code class="computeroutput">it1 ==
 i1.end()</code>
 AND <code class="computeroutput">it2 ==
 i2.end()</code>,
 </li>
-<li>
+<li class="listitem">
 OR <code class="computeroutput">it1</code> and <code class="computeroutput">it2</code> point to the same element.
 </li>
</ul></div>
-<pre class="programlisting">
-template< class IteratorType >
+<pre class="programlisting">template< class IteratorType >
left_iterator project_left(IteratorType iter);

template< class IteratorType >
left_const_iterator project_left(IteratorType iter) const;
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires:<code class="computeroutput">IteratorType</code>
 is a bimap view iterator. it is a valid iterator of some view of <code class="computeroutput">*this</code>
 (i.e. does not refer to some other <code class="computeroutput">bimap</code>.)
 </li>
-<li>
+<li class="listitem">
Effects: Returns a left map view iterator
 equivalent to <code class="computeroutput">it</code>.
 </li>
-<li>
+<li class="listitem">
Complexity: Constant.
 </li>
-<li>
+<li class="listitem">
Exception safety: nothrow.
 </li>
</ul></div>
-<pre class="programlisting">
-template< class IteratorType >
+<pre class="programlisting">template< class IteratorType >
right_iterator project_right(IteratorType iter);

template< class IteratorType >
right_const_iterator project_right(IteratorType iter) const;
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires:<code class="computeroutput">IteratorType</code>
 is a bimap view iterator. it is a valid iterator of some view of <code class="computeroutput">*this</code>
 (i.e. does not refer to some other <code class="computeroutput">bimap</code>.)
 </li>
-<li>
+<li class="listitem">
Effects: Returns a right map view
 iterator equivalent to <code class="computeroutput">it</code>.
 </li>
-<li>
+<li class="listitem">
Complexity: Constant.
 </li>
-<li>
+<li class="listitem">
Exception safety: nothrow.
 </li>
</ul></div>
-<pre class="programlisting">
-template< class IteratorType >
+<pre class="programlisting">template< class IteratorType >
iterator project_up(IteratorType iter);

template< class IteratorType >
const_iterator project_up(IteratorType iter) const;
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires:<code class="computeroutput">IteratorType</code>
 is a bimap view iterator. it is a valid iterator of some view of <code class="computeroutput">*this</code>
 (i.e. does not refer to some other <code class="computeroutput">bimap</code>.)
 </li>
-<li>
+<li class="listitem">
Effects: Returns a collection of relations
 view iterator equivalent to <code class="computeroutput">it</code>.
 </li>
-<li>
+<li class="listitem">
Complexity: Constant.
 </li>
-<li>
+<li class="listitem">
Exception safety: nothrow.
 </li>
</ul></div>
</div>
<a name="reference_support_for_used_defined_names"></a>
 
-<div class="section" lang="en">
+<div class="section" title="Support for user defined names">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.bimap_reference.class_template_bimap.support_for_user_defined_names"></a><a href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.support_for_user_defined_names" title="Support
- for user defined names">Support
+<a name="boost_bimap.reference.bimap_reference.class_template_bimap.support_for_user_defined_names"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.support_for_user_defined_names" title="Support for user defined names">Support
 for user defined names</a>
</h5></div></div></div>
-<pre class="programlisting">
-template< class Tag >
+<pre class="programlisting">template< class Tag >
struct map_by;
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
<code class="computeroutput">map_by<Tag>::type</code> yields the type of the map view
 tagged with <code class="computeroutput">Tag</code>. <code class="computeroutput">map_by<Tag>::</code>-type
 name- is the same as <code class="computeroutput">map_by<Tag>::type::</code>-type name-.
 </li>
-<li>
+<li class="listitem">
Requires: <code class="computeroutput">Tag</code>
 is a valid user defined name of the bimap.
 </li>
</ul></div>
-<pre class="programlisting">
-template< class Tag >
+<pre class="programlisting">template< class Tag >
map_by<Tag>::type by();

template< class Tag >
const map_by<Tag>::type & by() const;
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">Tag</code>
 is a valid user defined name of the bimap.
 </li>
-<li>
+<li class="listitem">
Effects: Returns a reference to the
 map view tagged with <code class="computeroutput">Tag</code>
 held by <code class="computeroutput">*this</code>.
 </li>
-<li>
+<li class="listitem">
Complexity: Constant.
 </li>
-<li>
+<li class="listitem">
Exception safety: nothrow.
 </li>
</ul></div>
-<pre class="programlisting">
-template< class Tag, class IteratorType >
+<pre class="programlisting">template< class Tag, class IteratorType >
map_by<Tag>::iterator project(IteratorType iter);

template< class Tag, class IteratorType >
map_by<Tag>::const_iterator project(IteratorType iter) const
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">Tag</code>
 is a valid user defined name of the bimap. <code class="computeroutput">IteratorType</code>
 is a bimap view iterator. it is a valid iterator of some view of <code class="computeroutput">*this</code>
 (i.e. does not refer to some other <code class="computeroutput">bimap</code>.)
 </li>
-<li>
+<li class="listitem">
Effects: Returns a reference to the
 map view tagged with <code class="computeroutput">Tag</code>
 held by <code class="computeroutput">*this</code>.
 </li>
-<li>
+<li class="listitem">
Complexity: Constant.
 </li>
-<li>
+<li class="listitem">
Exception safety: nothrow.
 </li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Serialization">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.bimap_reference.class_template_bimap.serialization"></a>Serialization
+<a name="boost_bimap.reference.bimap_reference.class_template_bimap.serialization"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.serialization" title="Serialization">Serialization</a>
</h5></div></div></div>

 A <code class="computeroutput">bimap</code> can be archived
@@ -935,7 +907,7 @@
 is serialization-compatible with <code class="computeroutput">p</code>
 if
 
-<div class="itemizedlist"><ul type="disc"><li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
<code class="computeroutput">p(x,y) == q(x</code>'<code class="computeroutput">,y</code>'<code class="computeroutput">)</code>
</li></ul></div>

@@ -943,32 +915,38 @@
 and <code class="computeroutput">x</code>' and <code class="computeroutput">y</code>' being restored copies of <code class="computeroutput">x</code> and <code class="computeroutput">y</code>,
 respectively.
 
-<div class="sidebar">
+<div class="sidebar">
+
+
 Operation: saving of a <code class="computeroutput">bimap b</code>
 to an output archive (XML archive) ar.
- </div>
-<div class="itemizedlist"><ul type="disc">
-<li>
+ 
+</div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: Value is serializable (XML-serializable).
 Additionally, each of the views of b can impose other requirements.
 </li>
-<li>
+<li class="listitem">
Exception safety: Strong with respect
 to <code class="computeroutput">b</code>. If an exception
 is thrown, ar may be left in an inconsistent state.
 </li>
</ul></div>
-<div class="sidebar">
+<div class="sidebar">
+
+
 Operation: loading of a <code class="computeroutput">bimap</code> m' from an input archive (XML
 archive) ar.
- </div>
-<div class="itemizedlist"><ul type="disc">
-<li>
+ 
+</div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: Value is serializable (XML-serializable).
 Additionally, each of the views of <code class="computeroutput">b</code>'
 can impose other requirements.
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic. If an exception
 is thrown, ar may be left in an inconsistent state.
 </li>

Modified: trunk/libs/bimap/doc/html/boost_bimap/reference/list_of_reference.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/reference/list_of_reference.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/reference/list_of_reference.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -3,30 +3,28 @@
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>list_of Reference</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="unordered_set_of_reference.html" title="unordered_set_of
- Reference">
-<link rel="next" href="vector_of_reference.html" title="vector_of
- Reference">
+<link rel="prev" href="unordered_set_of_reference.html" title="unordered_set_of Reference">
+<link rel="next" href="vector_of_reference.html" title="vector_of Reference">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="unordered_set_of_reference.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="vector_of_reference.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="list_of Reference">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.reference.list_of_reference"></a>list_of Reference
+<a name="boost_bimap.reference.list_of_reference"></a><a class="link" href="list_of_reference.html" title="list_of Reference">list_of Reference</a>
</h3></div></div></div>
<div class="toc"><dl>
<dt><a href="list_of_reference.html#boost_bimap.reference.list_of_reference.header__boost_bimap_list_of_hpp__synopsis">Header
@@ -50,14 +48,12 @@
<dt>Serialization</dt>
</dl></dd>
</dl></div>
-<div class="section" lang="en">
+<div class="section" title='Header "boost/bimap/list_of.hpp" synopsis'>
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.reference.list_of_reference.header__boost_bimap_list_of_hpp__synopsis"></a><a href="list_of_reference.html#boost_bimap.reference.list_of_reference.header__boost_bimap_list_of_hpp__synopsis" title='Header
- "boost/bimap/list_of.hpp" synopsis'>Header
+<a name="boost_bimap.reference.list_of_reference.header__boost_bimap_list_of_hpp__synopsis"></a><a class="link" href="list_of_reference.html#boost_bimap.reference.list_of_reference.header__boost_bimap_list_of_hpp__synopsis" title='Header "boost/bimap/list_of.hpp" synopsis'>Header
 "boost/bimap/list_of.hpp" synopsis</a>
</h4></div></div></div>
-<pre class="programlisting">
-namespace boost {
+<pre class="programlisting">namespace boost {
namespace bimaps {

@@ -71,10 +67,9 @@
} // namespace boost
</pre>
</div>
-<div class="section" lang="en">
+<div class="section" title="list_of Views">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.reference.list_of_reference.list_of_views"></a><a href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views" title="list_of
- Views">list_of
+<a name="boost_bimap.reference.list_of_reference.list_of_views"></a><a class="link" href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views" title="list_of Views">list_of
 Views</a>
</h4></div></div></div>
<div class="toc"><dl>
@@ -113,17 +108,17 @@

 There are a number of differences with respect to <code class="computeroutput">std::lists</code>:
 
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 list_of views are not Assignable
 (like any other view.)
 </li>
-<li>
+<li class="listitem">
 Unlike as in <code class="computeroutput">std::list</code>, insertions into a list_of view
 may fail due to clashings with other views. This alters the semantics
 of the operations provided with respect to their analogues in <code class="computeroutput">std::list</code>.
 </li>
-<li>
+<li class="listitem">
 Elements in a list_of view are not mutable, and can only be changed by
 means of <code class="computeroutput">replace</code> and
 <code class="computeroutput">modify</code> member functions.
@@ -137,8 +132,7 @@
 and operations that are either not present in the concepts modeled or do
 not exactly conform to the requirements for these types of containers.
 
-<pre class="programlisting">
-namespace boost {
+<pre class="programlisting">namespace boost {
namespace bimaps {
namespace views {

@@ -169,9 +163,9 @@
 this_type & operator=(const this_type & x);

 template< class InputIterator >
- void assign(InputIterator first, InputIterator last);
+ void <a class="link" href="list_of_reference.html#reference_list_of_assign_iterator_iterator">assign</a>(InputIterator first, InputIterator last);

- void assign(size_type n, const value_type & value);
+ void <a class="link" href="list_of_reference.html#reference_list_of_assign_size_value">assign</a>(size_type n, const value_type & value);

 allocator_type get_allocator() const;

@@ -197,7 +191,7 @@

 size_type max_size() const;

- void resize(size_type n, const value_type & x = value_type());
+ void <a class="link" href="list_of_reference.html#reference_list_of_resize_size_value">resize</a>(size_type n, const value_type & x = value_type());

 // access

@@ -206,38 +200,38 @@

 // modifiers

- std::pair<iterator,bool> push_front(const value_type & x);
+ std::pair<iterator,bool> <a class="link" href="list_of_reference.html#reference_list_of_push_front_value">push_front</a>(const value_type & x);
 void pop_front();

- std::pair<iterator,bool> push_back(const value_type & x);
+ std::pair<iterator,bool> <a class="link" href="list_of_reference.html#reference_list_of_push_back_value">push_back</a>(const value_type & x);
 void pop_back();

- std::pair<iterator,bool> insert(iterator position, const value_type & x);
+ std::pair<iterator,bool> <a class="link" href="list_of_reference.html#reference_list_of_insert_iterator_value">insert</a>(iterator position, const value_type & x);

- void insert(iterator position, size_type n, const value_type & x);
+ void <a class="link" href="list_of_reference.html#reference_list_of_insert_iterator_size_value">insert</a>(iterator position, size_type n, const value_type & x);

 template< class InputIterator >
- void insert(iterator position, InputIterator first, InputIterator last);
+ void <a class="link" href="list_of_reference.html#reference_list_of_insert_iterator_iterator_iterator">insert</a>(iterator position, InputIterator first, InputIterator last);

- iterator erase(iterator position);
- iterator erase(iterator first, iterator last);
+ iterator <a class="link" href="list_of_reference.html#reference_list_of_erase_iterator">erase</a>(iterator position);
+ iterator <a class="link" href="list_of_reference.html#reference_list_of_erase_iterator_iterator">erase</a>(iterator first, iterator last);

- bool replace(iterator position, const value_type & x);
+ bool <a class="link" href="list_of_reference.html#reference_list_of_replace_iterator_value">replace</a>(iterator position, const value_type & x);

 // Only in map views
 // {

 template< class CompatibleKey >
- bool replace_key(iterator position, const CompatibleKey & x);
+ bool <a class="link" href="list_of_reference.html#reference_list_of_replace_key_iterator_key">replace_key</a>(iterator position, const CompatibleKey & x);

 template< class CompatibleData >
- bool replace_data(iterator position, const CompatibleData & x);
+ bool <a class="link" href="list_of_reference.html#reference_list_of_replace_data_iterator_data">replace_data</a>(iterator position, const CompatibleData & x);

 template< class KeyModifier >
- bool modify_key(iterator position, KeyModifier mod);
+ bool <a class="link" href="list_of_reference.html#reference_list_of_modify_key_iterator_modifier">modify_key</a>(iterator position, KeyModifier mod);

 template< class DataModifier >
- bool modify_data(iterator position, DataModifier mod);
+ bool <a class="link" href="list_of_reference.html#reference_list_of_modify_data_iterator_modifier">modify_data</a>(iterator position, DataModifier mod);

 // }

@@ -246,32 +240,32 @@

 // list operations

- void splice(iterator position, this_type & x);
- void splice(iterator position, this_type & x, iterator i);
+ void <a class="link" href="list_of_reference.html#reference_list_of_splice_iterator_this">splice</a>(iterator position, this_type & x);
+ void <a class="link" href="list_of_reference.html#reference_list_of_splice_iterator_this_iterator">splice</a>(iterator position, this_type & x, iterator i);
 void splice(
 iterator position, this_type & x, iterator first, iterator last);

- void remove(const value_type & value);
+ void <a class="link" href="list_of_reference.html#reference_list_of_remove_value">remove</a>(const value_type & value);

 template< class Predicate >
- void remove_if(Predicate pred);
+ void <a class="link" href="list_of_reference.html#reference_list_of_remove_if_predicate">remove_if</a>(Predicate pred);

- void unique();
+ void <a class="link" href="list_of_reference.html#reference_list_of_unique">unique</a>();

 template< class BinaryPredicate >
- void unique(BinaryPredicate binary_pred);
+ void <a class="link" href="list_of_reference.html#reference_list_of_unique_predicate">unique</a>(BinaryPredicate binary_pred);

- void merge(this_type & x);
+ void <a class="link" href="list_of_reference.html#reference_list_of_merge_this">merge</a>(this_type & x);

 template< class Compare >
- void merge(this_type & x,Compare comp);
+ void <a class="link" href="list_of_reference.html#reference_list_of_merge_this_compare">merge</a>(this_type & x,Compare comp);

- void sort();
+ void <a class="link" href="list_of_reference.html#reference_list_of_sort">sort</a>();

 template< class Compare >
- void sort(Compare comp);
+ void <a class="link" href="list_of_reference.html#reference_list_of_sort_compare">sort</a>(Compare comp);

- void reverse();
+ void <a class="link" href="list_of_reference.html#reference_list_of_reverse">reverse</a>();

 // rearrange operations

@@ -299,15 +293,13 @@

 In the set view:
 
-<pre class="programlisting">
-typedef signature-compatible with relation< Left, ... > key_type;
+<pre class="programlisting">typedef signature-compatible with relation< Left, ... > key_type;
typedef signature-compatible with relation< Left, ... > value_type;
</pre>

 In the left map view:
 
-<pre class="programlisting">
-typedef Left key_type;
+<pre class="programlisting">typedef Left key_type;
typedef ... data_type;

typedef signature-compatible with std::pair< Left, ... > value_type;
@@ -315,50 +307,47 @@

 In the right map view:
 
-<pre class="programlisting">
-typedef ... key_type;
+<pre class="programlisting">typedef ... key_type;
typedef Left data_type;

typedef signature-compatible with std::pair< ... , Left > value_type;
</pre>
<a name="list_of_complexity_signature"></a>
 
-<div class="section" lang="en">
+<div class="section" title="Complexity signature">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.list_of_reference.list_of_views.complexity_signature"></a><a href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.complexity_signature" title="Complexity
- signature">Complexity
+<a name="boost_bimap.reference.list_of_reference.list_of_views.complexity_signature"></a><a class="link" href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.complexity_signature" title="Complexity signature">Complexity
 signature</a>
</h5></div></div></div>

 Here and in the descriptions of operations of <code class="computeroutput">list_of</code>
- views, we adopt the scheme outlined in the <a href="bimap_reference.html#complexity_signature_explanation">complexity
+ views, we adopt the scheme outlined in the <a class="link" href="bimap_reference.html#complexity_signature_explanation">complexity
 signature section</a>. The complexity signature of a <code class="computeroutput">list_of</code> view is:
 
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 copying: <code class="computeroutput">c(n) = n * log(n)</code>,
 </li>
-<li>
+<li class="listitem">
 insertion: <code class="computeroutput">i(n) = 1</code> (constant),
 </li>
-<li>
+<li class="listitem">
 hinted insertion: <code class="computeroutput">h(n) = 1</code> (constant),
 </li>
-<li>
+<li class="listitem">
 deletion: <code class="computeroutput">d(n) = 1</code> (constant),
 </li>
-<li>
+<li class="listitem">
 replacement: <code class="computeroutput">r(n) = 1</code> (constant),
 </li>
-<li>
+<li class="listitem">
 modifying: <code class="computeroutput">m(n) = 1</code> (constant).
 </li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Instantiation types">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.list_of_reference.list_of_views.instantiation_types"></a><a href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.instantiation_types" title="Instantiation
- types">Instantiation
+<a name="boost_bimap.reference.list_of_reference.list_of_views.instantiation_types"></a><a class="link" href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.instantiation_types" title="Instantiation types">Instantiation
 types</a>
</h5></div></div></div>

@@ -367,46 +356,43 @@
 specified by means of the collection type specifiers and the bimap itself.
 Instantiations are dependent on the following types:
 
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
<code class="computeroutput">Value</code> from <code class="computeroutput">list_of</code>,
 </li>
-<li>
+<li class="listitem">
<code class="computeroutput">Allocator</code> from <code class="computeroutput">bimap</code>,
 </li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Constructors, copy and assignment">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.list_of_reference.list_of_views.constructors__copy_and_assignment"></a><a href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.constructors__copy_and_assignment" title="Constructors,
- copy and assignment">Constructors,
+<a name="boost_bimap.reference.list_of_reference.list_of_views.constructors__copy_and_assignment"></a><a class="link" href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.constructors__copy_and_assignment" title="Constructors, copy and assignment">Constructors,
 copy and assignment</a>
</h5></div></div></div>

 As explained in the view concepts section, views do not have public constructors
 or destructors. Assignment, on the other hand, is provided.
 
-<pre class="programlisting">
-this_type & operator=(const this_type & x);
+<pre class="programlisting">this_type & operator=(const this_type & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: <code class="computeroutput">a
 = b;</code> where a and b are the <code class="computeroutput">bimap</code> objects to which <code class="computeroutput">*this</code>
 and <code class="computeroutput">x</code> belong, respectively.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">*this</code>.
 </li>
</ul></div>
<a name="reference_list_of_assign_iterator_iterator"></a>
 
-<pre class="programlisting">
-template< class InputIterator >
+<pre class="programlisting">template< class InputIterator >
void assign(InputIterator first, InputIterator last);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">InputIterator</code>
 is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html" target="_top">Input
 Iterator</a> over elements of type <code class="computeroutput">value_type</code>
@@ -415,16 +401,15 @@
 <code class="computeroutput">last</code> is reachable from
 <code class="computeroutput">first</code>.
 </li>
-<li>
+<li class="listitem">
Effects: <code class="computeroutput">clear(); insert(end(),first,last);</code>
</li>
</ul></div>
<a name="reference_list_of_assign_size_value"></a>
 
-<pre class="programlisting">
-void assign(size_type n, const value_type & value);
+<pre class="programlisting">void assign(size_type n, const value_type & value);
</pre>
-<div class="itemizedlist"><ul type="disc"><li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
Effects: <code class="computeroutput">clear(); for(size_type
 i =
 0;
@@ -433,19 +418,17 @@
 ++n) push_back(v);</code>
</li></ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Capacity operations">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.list_of_reference.list_of_views.capacity_operations"></a><a href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.capacity_operations" title="Capacity
- operations">Capacity
+<a name="boost_bimap.reference.list_of_reference.list_of_views.capacity_operations"></a><a class="link" href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.capacity_operations" title="Capacity operations">Capacity
 operations</a>
</h5></div></div></div>
<a name="reference_list_of_resize_size_value"></a>
 
-<pre class="programlisting">
-void resize(size_type n,const value_type& x=value_type());
+<pre class="programlisting">void resize(size_type n,const value_type& x=value_type());
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: <code class="computeroutput">if( n > size() ) insert(end(),
 n -
 size(),
@@ -453,28 +436,27 @@
 it =
 begin();</code><code class="computeroutput"> std::advance(it, n);</code><code class="computeroutput"> erase(it, end());</code><code class="computeroutput">}</code>
</li>
-<li>
+<li class="listitem">
Note: If an expansion is requested,
 the size of the view is not guaranteed to be n after this operation
 (other views may ban insertions.)
 </li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Modifiers">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.list_of_reference.list_of_views.modifiers"></a>Modifiers
+<a name="boost_bimap.reference.list_of_reference.list_of_views.modifiers"></a><a class="link" href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.modifiers" title="Modifiers">Modifiers</a>
</h5></div></div></div>
<a name="reference_list_of_push_front_value"></a>
 
-<pre class="programlisting">
-std::pair<iterator,bool> push_front(const value_type& x);
+<pre class="programlisting">std::pair<iterator,bool> push_front(const value_type& x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: Inserts <code class="computeroutput">x</code>
 at the beginning of the sequence if no other views of the <code class="computeroutput">bimap</code> bans the insertion.
 </li>
-<li>
+<li class="listitem">
Returns: The return value is a pair
 <code class="computeroutput">p</code>. <code class="computeroutput">p.second</code>
 is <code class="computeroutput">true</code> if and only if
@@ -483,26 +465,25 @@
 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.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
 O(I(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Strong.
 </li>
</ul></div>
<a name="reference_list_of_push_back_value"></a>
 
-<pre class="programlisting">
-std::pair<iterator,bool> push_back(const value_type & x);
+<pre class="programlisting">std::pair<iterator,bool> push_back(const value_type & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: Inserts <code class="computeroutput">x</code>
 at the end of the sequence if no other views of the <code class="computeroutput">bimap</code>
 bans the insertion.
 </li>
-<li>
+<li class="listitem">
Returns: The return value is a pair
 <code class="computeroutput">p</code>. <code class="computeroutput">p.second</code>
 is <code class="computeroutput">true</code> if and only if
@@ -511,31 +492,30 @@
 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.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
 O(I(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Strong.
 </li>
</ul></div>
<a name="reference_list_of_insert_iterator_value"></a>
 
-<pre class="programlisting">
-std::pair<iterator,bool> insert(iterator position, const value_type & x);
+<pre class="programlisting">std::pair<iterator,bool> insert(iterator position, const value_type & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid <code class="computeroutput">iterator</code>
 of the view.
 </li>
-<li>
+<li class="listitem">
Effects: Inserts <code class="computeroutput">x</code>
 before position if insertion is allowed by all other views of the
 <code class="computeroutput">bimap</code>.
 </li>
-<li>
+<li class="listitem">
Returns: The return value is a pair
 <code class="computeroutput">p</code>. <code class="computeroutput">p.second</code>
 is <code class="computeroutput">true</code> if and only if
@@ -544,26 +524,25 @@
 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.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
 O(I(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Strong.
 </li>
</ul></div>
<a name="reference_list_of_insert_iterator_size_value"></a>
 
-<pre class="programlisting">
-void insert(iterator position, size_type n, const value_type & x);
+<pre class="programlisting">void insert(iterator position, size_type n, const value_type & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid <code class="computeroutput">iterator</code>
 of the view.
 </li>
-<li>
+<li class="listitem">
Effects: <code class="computeroutput">for(size_type
 i =
 0;
@@ -574,12 +553,11 @@
</ul></div>
<a name="reference_list_of_insert_iterator_iterator_iterator"></a>
 
-<pre class="programlisting">
-template< class InputIterator>
+<pre class="programlisting">template< class InputIterator>
void insert(iterator position,InputIterator first,InputIterator last);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid <code class="computeroutput">iterator</code>
 of the view. <code class="computeroutput">InputIterator</code>
@@ -590,99 +568,96 @@
 this view belongs. <code class="computeroutput">last</code>
 is reachable from <code class="computeroutput">first</code>.
 </li>
-<li>
+<li class="listitem">
Effects: <code class="computeroutput">while(first
 != last) insert(position, *first++);</code>
</li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
 O(m*I(n+m)), where m is the number of elements in <code class="computeroutput">[first,last)</code>.
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic.
 </li>
</ul></div>
<a name="reference_list_of_erase_iterator"></a>
 
-<pre class="programlisting">
-iterator erase(iterator position);
+<pre class="programlisting">iterator erase(iterator position);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid dereferenceable <code class="computeroutput">iterator</code>
 of the view.
 </li>
-<li>
+<li class="listitem">
Effects: Deletes the element pointed
 to by <code class="computeroutput">position</code>.
 </li>
-<li>
+<li class="listitem">
Returns: An iterator pointing to the
 element immediately following the one that was deleted, or <code class="computeroutput">end()</code>
 if no such element exists.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
 O(D(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: nothrow.
 </li>
</ul></div>
<a name="reference_list_of_erase_iterator_iterator"></a>
 
-<pre class="programlisting">
-iterator erase(iterator first, iterator last);
+<pre class="programlisting">iterator erase(iterator first, iterator last);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">[first,last)</code>
 is a valid range of the view.
 </li>
-<li>
+<li class="listitem">
Effects: Deletes the elements in
 <code class="computeroutput">[first,last)</code>.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">last</code>.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
 O(m*D(n)), where m is the number of elements in <code class="computeroutput">[first,last)</code>.
 </li>
-<li>
+<li class="listitem">
Exception safety: nothrow.
 </li>
</ul></div>
<a name="reference_list_of_replace_iterator_value"></a>
 
-<pre class="programlisting">
-bool replace(iterator position,const value_type& x);
+<pre class="programlisting">bool replace(iterator position,const value_type& x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid dereferenceable iterator of the view.
 </li>
-<li>
+<li class="listitem">
Effects: Assigns the value <code class="computeroutput">x</code> to the element pointed to by <code class="computeroutput">position</code> into the <code class="computeroutput">bimap</code>
 to which the view belongs if replacing is allowed by all other views
 of the <code class="computeroutput">bimap</code>.
 </li>
-<li>
+<li class="listitem">
Postconditions: Validity of <code class="computeroutput">position</code> is preserved in all cases.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">true</code>
 if the replacement took place, <code class="computeroutput">false</code>
 otherwise.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
 O(R(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Strong. If an exception
 is thrown by some user-provided operation the <code class="computeroutput">bimap</code>
 to which the view belongs remains in its original state.
@@ -690,17 +665,16 @@
</ul></div>
<a name="reference_list_of_replace_key_iterator_key"></a>
 
-<pre class="programlisting">
-template< class CompatibleKey >
+<pre class="programlisting">template< class CompatibleKey >
bool replace_key(iterator position, const CompatibleKey & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid dereferenceable iterator of the set view. <code class="computeroutput">CompatibleKey</code> can be assigned to
 <code class="computeroutput">key_type</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Assigns the value <code class="computeroutput">x</code> to <code class="computeroutput">e.first</code>,
 where <code class="computeroutput">e</code> is the element
 pointed to by <code class="computeroutput">position</code>
@@ -708,20 +682,20 @@
 the set view belongs if replacing is allowed by all other views of
 the <code class="computeroutput">bimap</code>.
 </li>
-<li>
+<li class="listitem">
Postconditions: Validity of position
 is preserved in all cases.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">true</code>
 if the replacement took place, <code class="computeroutput">false</code>
 otherwise.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
 O(R(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Strong. If an exception
 is thrown by some user-provided operation, the <code class="computeroutput">bimap</code>
 to which the set view belongs remains in its original state.
@@ -729,17 +703,16 @@
</ul></div>
<a name="reference_list_of_replace_data_iterator_data"></a>
 
-<pre class="programlisting">
-template< class CompatibleData >
+<pre class="programlisting">template< class CompatibleData >
bool replace_data(iterator position, const CompatibleData & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid dereferenceable iterator of the set view. <code class="computeroutput">CompatibleKey</code> can be assigned to
 <code class="computeroutput">data_type</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Assigns the value <code class="computeroutput">x</code> to <code class="computeroutput">e.second</code>,
 where <code class="computeroutput">e</code> is the element
 pointed to by <code class="computeroutput">position</code>
@@ -747,20 +720,20 @@
 the set view belongs if replacing is allowed by all other views of
 the <code class="computeroutput">bimap</code>.
 </li>
-<li>
+<li class="listitem">
Postconditions: Validity of position
 is preserved in all cases.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">true</code>
 if the replacement took place, <code class="computeroutput">false</code>
 otherwise.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
 O(R(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Strong. If an exception
 is thrown by some user-provided operation, the <code class="computeroutput">bimap</code>
 to which the set view belongs remains in its original state.
@@ -768,93 +741,90 @@
</ul></div>
<a name="reference_list_of_modify_key_iterator_modifier"></a>
 
-<pre class="programlisting">
-template< class KeyModifier >
+<pre class="programlisting">template< class KeyModifier >
bool modify_key(iterator position, KeyModifier mod);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">KeyModifier</code>
 is a model of <a href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">Unary
 Function</a> accepting arguments of type: <code class="computeroutput">key_type&</code>; <code class="computeroutput">position</code>
 is a valid dereferenceable iterator of the view.
 </li>
-<li>
+<li class="listitem">
Effects: Calls <code class="computeroutput">mod(e.first)</code> where e is the element pointed to
 by position and rearranges <code class="computeroutput">*position</code> into all the views of the
 <code class="computeroutput">bimap</code>. If the rearrangement
 fails, the element is erased. It is successful if the rearrangement
 is allowed by all other views of the <code class="computeroutput">bimap</code>.
 </li>
-<li>
+<li class="listitem">
Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
 succeeds.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">true</code>
 if the operation succeeded, <code class="computeroutput">false</code>
 otherwise.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
 O(M(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic. If an exception
 is thrown by some user-provided operation (except possibly mod), then
 the element pointed to by position is erased.
 </li>
-<li>
+<li class="listitem">
Note: Only provided for map views.
 </li>
</ul></div>
<a name="reference_list_of_modify_data_iterator_modifier"></a>
 
-<pre class="programlisting">
-template< class DataModifier >
+<pre class="programlisting">template< class DataModifier >
bool modify_data(iterator position, DataModifier mod);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">DataModifier</code>
 is a model of <a href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">Unary
 Function</a> accepting arguments of type: <code class="computeroutput">data_type&</code>; <code class="computeroutput">position</code>
 is a valid dereferenceable iterator of the view.
 </li>
-<li>
+<li class="listitem">
Effects: Calls <code class="computeroutput">mod(e.second)</code> where e is the element pointed to
 by position and rearranges <code class="computeroutput">*position</code> into all the views of the
 <code class="computeroutput">bimap</code>. If the rearrangement
 fails, the element is erased. It is successful if the rearrangement
 is allowed by all other views of the <code class="computeroutput">bimap</code>.
 </li>
-<li>
+<li class="listitem">
Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
 succeeds.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">true</code>
 if the operation succeeded, <code class="computeroutput">false</code>
 otherwise.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
 O(M(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic. If an exception
 is thrown by some user-provided operation (except possibly mod), then
 the element pointed to by position is erased.
 </li>
-<li>
+<li class="listitem">
Note: Only provided for map views.
 </li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="List operations">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.list_of_reference.list_of_views.list_operations"></a><a href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.list_operations" title="List
- operations">List
+<a name="boost_bimap.reference.list_of_reference.list_of_views.list_operations"></a><a class="link" href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.list_operations" title="List operations">List
 operations</a>
</h5></div></div></div>

@@ -868,67 +838,64 @@
 
<a name="reference_list_of_splice_iterator_this"></a>
 
-<pre class="programlisting">
-void splice(iterator position, this_type & x);
+<pre class="programlisting">void splice(iterator position, this_type & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view. <code class="computeroutput">&x!=this</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Inserts the contents of
 <code class="computeroutput">x</code> before position,
 in the same order as they were in <code class="computeroutput">x</code>.
 Those elements successfully inserted are erased from <code class="computeroutput">x</code>.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
 O(<code class="computeroutput">x.size()</code>*I(n+<code class="computeroutput">x.size()</code>)
 + <code class="computeroutput">x.size()</code>*D(<code class="computeroutput">x.size()</code>)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic.
 </li>
</ul></div>
<a name="reference_list_of_splice_iterator_this_iterator"></a>
 
-<pre class="programlisting">
-void splice(iterator position, this_type & x,iterator i);
+<pre class="programlisting">void splice(iterator position, this_type & x,iterator i);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view. <code class="computeroutput">i</code>
 is a valid dereferenceable iterator <code class="computeroutput">x</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Inserts the element pointed
 to by <code class="computeroutput">i</code> before position:
 if insertion is successful, the element is erased from <code class="computeroutput">x</code>. In the special case <code class="computeroutput">&x==this</code>,
 no copy or deletion is performed, and the operation is always successful.
 If <code class="computeroutput">position==i</code>, no operation is performed.
 </li>
-<li>
+<li class="listitem">
Postconditions: If <code class="computeroutput">&x==this</code>, no iterator or reference is invalidated.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
 If <code class="computeroutput">&x==this</code>,
 constant; otherwise O(I(n) + D(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: If <code class="computeroutput">&x==this</code>,
 nothrow; otherwise, strong.
 </li>
</ul></div>
<a name="reference_list_of_splice_iterator_this_iterator_iterator"></a>
 
-<pre class="programlisting">
-void splice(iterator position, this_type & x, iterator first, iterator last);
+<pre class="programlisting">void splice(iterator position, this_type & x, iterator first, iterator last);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view. <code class="computeroutput">first</code>
 and <code class="computeroutput">last</code> are valid
@@ -936,119 +903,114 @@
 is reachable from <code class="computeroutput">first</code>.
 position is not in the range <code class="computeroutput">[first,last)</code>.
 </li>
-<li>
+<li class="listitem">
Effects: For each element in the range
 <code class="computeroutput">[first,last)</code>, insertion is tried before position;
 if the operation is successful, the element is erased from x. In the
 special case <code class="computeroutput">&x==this</code>,
 no copy or deletion is performed, and insertions are always successful.
 </li>
-<li>
+<li class="listitem">
Postconditions: If <code class="computeroutput">&x==this</code>, no iterator or reference is invalidated.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
 If <code class="computeroutput">&x==this</code>,
 constant; otherwise O(m*I(n+m) + m*D(x.size())) where m is the number
 of elements in <code class="computeroutput">[first,last)</code>.
 </li>
-<li>
+<li class="listitem">
Exception safety: If <code class="computeroutput">&x==this</code>,
 nothrow; otherwise, basic.
 </li>
</ul></div>
<a name="reference_list_of_remove_value"></a>
 
-<pre class="programlisting">
-void remove(const value_type & value);
+<pre class="programlisting">void remove(const value_type & value);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: Erases all elements of the
 view which compare equal to <code class="computeroutput">value</code>.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
 O(n + m*D(n)), where m is the number of elements erased.
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic.
 </li>
</ul></div>
<a name="reference_list_of_remove_if_predicate"></a>
 
-<pre class="programlisting">
-template< class Predicate >
+<pre class="programlisting">template< class Predicate >
void remove_if(Predicate pred);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: Erases all elements <code class="computeroutput">x</code> of the view for which <code class="computeroutput">pred(x)</code>
 holds.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
 O(n + m*D(n)), where m is the number of elements erased.
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic.
 </li>
</ul></div>
<a name="reference_list_of_unique"></a>
 
-<pre class="programlisting">
-void unique();
+<pre class="programlisting">void unique();
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: Eliminates all but the first
 element from every consecutive group of equal elements referred to
 by the iterator <code class="computeroutput">i</code> in
 the range <code class="computeroutput">[first+1,last)</code>
 for which <code class="computeroutput">*i==*(i-1)</code>.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
 O(n + m*D(n)), where m is the number of elements erased.
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic.
 </li>
</ul></div>
<a name="reference_list_of_unique_predicate"></a>
 
-<pre class="programlisting">
-template< class BinaryPredicate >
+<pre class="programlisting">template< class BinaryPredicate >
void unique(BinaryPredicate binary_pred);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: Eliminates all but the first
 element from every consecutive group of elements referred to by the
 iterator i in the range [first+1,last) for which <code class="computeroutput">binary_pred(*i,*(i-1))</code>
 holds.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
 O(n + m*D(n)), where m is the number of elements erased.
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic.
 </li>
</ul></div>
<a name="reference_list_of_merge_this"></a>
 
-<pre class="programlisting">
-void merge(this_type & x);
+<pre class="programlisting">void merge(this_type & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">std::less<value_type></code> is a <a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html" target="_top">Strict
 Weak Ordering</a> over <code class="computeroutput">value_type</code>.
 Both the view and <code class="computeroutput">x</code>
 are sorted according to <code class="computeroutput">std::less<value_type></code>.
 </li>
-<li>
+<li class="listitem">
Effects: Attempts to insert every
 element of <code class="computeroutput">x</code> into the
 corresponding position of the view (according to the order). Elements
@@ -1057,37 +1019,36 @@
 container preserve their relative position. In the special case <code class="computeroutput">&x==this</code>,
 no operation is performed.
 </li>
-<li>
+<li class="listitem">
Postconditions: Elements in the view
 and remaining elements in <code class="computeroutput">x</code>
 are sorted. Validity of iterators to the view and of non-erased elements
 of <code class="computeroutput">x</code> references is
 preserved.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
 If <code class="computeroutput">&x==this</code>,
 constant; otherwise O(n + <code class="computeroutput">x.size()</code>*I(n+<code class="computeroutput">x.size()</code>) + <code class="computeroutput">x.size()</code>*D(<code class="computeroutput">x.size()</code>)).
 </li>
-<li>
+<li class="listitem">
Exception safety: If <code class="computeroutput">&x==this</code>,
 nothrow; otherwise, basic.
 </li>
</ul></div>
<a name="reference_list_of_merge_this_compare"></a>
 
-<pre class="programlisting">
-template< class Compare >
+<pre class="programlisting">template< class Compare >
void merge(this_type & x, Compare comp);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: Compare is a <a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html" target="_top">Strict
 Weak Ordering</a> over <code class="computeroutput">value_type</code>.
 Both the view and <code class="computeroutput">x</code>
 are sorted according to <code class="computeroutput">comp</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Attempts to insert every
 element of <code class="computeroutput">x</code> into the
 corresponding position of the view (according to <code class="computeroutput">comp</code>).
@@ -1096,104 +1057,100 @@
 container preserve their relative position. In the special case <code class="computeroutput">&x==this</code>,
 no operation is performed.
 </li>
-<li>
+<li class="listitem">
Postconditions: Elements in the view
 and remaining elements in <code class="computeroutput">x</code>
 are sorted according to <code class="computeroutput">comp</code>.
 Validity of iterators to the view and of non-erased elements of <code class="computeroutput">x</code> references is preserved.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
 If <code class="computeroutput">&x==this</code>,
 constant; otherwise O(n + <code class="computeroutput">x.size()</code>*I(n+<code class="computeroutput">x.size()</code>) + <code class="computeroutput">x.size()</code>*D(<code class="computeroutput">x.size()</code>)).
 </li>
-<li>
+<li class="listitem">
Exception safety: If <code class="computeroutput">&x==this</code>,
 nothrow; otherwise, basic.
 </li>
</ul></div>
<a name="reference_list_of_sort"></a>
 
-<pre class="programlisting">
-void sort();
+<pre class="programlisting">void sort();
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">std::less<value_type></code> is a <a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html" target="_top">Strict
 Weak Ordering</a> over value_type.
 </li>
-<li>
+<li class="listitem">
Effects: Sorts the view according
 to <code class="computeroutput">std::less<value_type></code>.
 The sorting is stable, i.e. equivalent elements preserve their relative
 position.
 </li>
-<li>
+<li class="listitem">
Postconditions: Validity of iterators
 and references is preserved.
 </li>
-<li>
+<li class="listitem">
Complexity: O(n*log(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: nothrow if <code class="computeroutput">std::less<value_type></code>
 does not throw; otherwise, basic.
 </li>
</ul></div>
<a name="reference_list_of_sort_compare"></a>
 
-<pre class="programlisting">
-template< typename Compare >
+<pre class="programlisting">template< typename Compare >
void sort(Compare comp);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: Compare is a <a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html" target="_top">Strict
 Weak Ordering</a> over value_type.
 </li>
-<li>
+<li class="listitem">
Effects: Sorts the view according
 to comp. The sorting is stable, i.e. equivalent elements preserve their
 relative position.
 </li>
-<li>
+<li class="listitem">
Postconditions: Validity of iterators
 and references is preserved.
 </li>
-<li>
+<li class="listitem">
Complexity: O(n*log(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: nothrow if comp
 does not throw; otherwise, basic.
 </li>
</ul></div>
<a name="reference_list_of_reverse"></a>
 
-<pre class="programlisting">
-void reverse();
+<pre class="programlisting">void reverse();
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: Reverses the order of the
 elements in the view.
 </li>
-<li>
+<li class="listitem">
Postconditions: Validity of iterators
 and references is preserved.
 </li>
-<li>
+<li class="listitem">
Complexity: O(n).
 </li>
-<li>
+<li class="listitem">
Exception safety: nothrow.
 </li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Rearrange operations">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.list_of_reference.list_of_views.rearrange_operations"></a><a href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.rearrange_operations" title="Rearrange
- operations">Rearrange
+<a name="boost_bimap.reference.list_of_reference.list_of_views.rearrange_operations"></a><a class="link" href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.rearrange_operations" title="Rearrange operations">Rearrange
 operations</a>
</h5></div></div></div>

@@ -1203,38 +1160,36 @@
 
<a name="reference_list_of_relocate_iterator_iterator"></a>
 
-<pre class="programlisting">
-void relocate(iterator position, iterator i);
+<pre class="programlisting">void relocate(iterator position, iterator i);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view. <code class="computeroutput">i</code>
 is a valid dereferenceable iterator of the view.
 </li>
-<li>
+<li class="listitem">
Effects: Inserts the element pointed
 to by <code class="computeroutput">i</code> before <code class="computeroutput">position</code>. If <code class="computeroutput">position==i</code>,
 no operation is performed.
 </li>
-<li>
+<li class="listitem">
Postconditions: No iterator or reference
 is invalidated.
 </li>
-<li>
+<li class="listitem">
Complexity: Constant.
 </li>
-<li>
+<li class="listitem">
Exception safety: nothrow.
 </li>
</ul></div>
<a name="reference_list_of_relocate_iterator_iterator_iterator"></a>
 
-<pre class="programlisting">
-void relocate(iterator position, iterator first, iterator last);
+<pre class="programlisting">void relocate(iterator position, iterator first, iterator last);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view. <code class="computeroutput">first</code>
 and <code class="computeroutput">last</code> are valid
@@ -1243,24 +1198,24 @@
 <code class="computeroutput">position</code> is not in
 the range <code class="computeroutput">[first,last)</code>.
 </li>
-<li>
+<li class="listitem">
Effects: The range of elements <code class="computeroutput">[first,last)</code> is repositioned just before <code class="computeroutput">position</code>.
 </li>
-<li>
+<li class="listitem">
Postconditions: No iterator or reference
 is invalidated.
 </li>
-<li>
+<li class="listitem">
Complexity: Constant.
 </li>
-<li>
+<li class="listitem">
Exception safety: nothrow.
 </li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Serialization">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.list_of_reference.list_of_views.serialization"></a>Serialization
+<a name="boost_bimap.reference.list_of_reference.list_of_views.serialization"></a><a class="link" href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.serialization" title="Serialization">Serialization</a>
</h5></div></div></div>

 Views cannot be serialized on their own, but only as part of the <code class="computeroutput">bimap</code> into which they are embedded.
@@ -1270,19 +1225,25 @@
 defined in the <code class="computeroutput">bimap</code>
 serialization section.
 
-<div class="sidebar">
+<div class="sidebar">
+
+
 Operation: saving of a <code class="computeroutput">bimap</code> b to an output archive (XML archive)
 ar.
- </div>
-<div class="itemizedlist"><ul type="disc"><li>
+ 
+</div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
Requires: No additional requirements
 to those imposed by the container.
 </li></ul></div>
-<div class="sidebar">
+<div class="sidebar">
+
+
 Operation: loading of a <code class="computeroutput">bimap</code> b' from an input archive (XML
 archive) ar.
- </div>
-<div class="itemizedlist"><ul type="disc"><li>
+ 
+</div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
Requires: No additional requirements
 to those imposed by the container. Postconditions:
 On successful loading, each of the elements of <code class="computeroutput">[begin(),
@@ -1293,28 +1254,34 @@
 of the <code class="computeroutput">list_of</code> view
 in the container.
 </li></ul></div>
-<div class="sidebar">
+<div class="sidebar">
+
+
 Operation: saving of an <code class="computeroutput">iterator</code> or <code class="computeroutput">const_iterator</code>
 it to an output archive (XML archive) ar.
- </div>
-<div class="itemizedlist"><ul type="disc"><li>
+ 
+</div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
Requires: <code class="computeroutput">it</code>
 is a valid iterator of the view. The associated <code class="computeroutput">bimap</code>
 has been previously saved.
 </li></ul></div>
-<div class="sidebar">
+<div class="sidebar">
+
+
 Operation: loading of an <code class="computeroutput">iterator</code> or <code class="computeroutput">const_iterator
 it</code>' from an input archive (XML
 archive) ar.
- </div>
-<div class="itemizedlist"><ul type="disc">
-<li>
+ 
+</div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Postconditions: On successful loading,
 if it was dereferenceable then <code class="computeroutput">*it</code>' is the restored copy of <code class="computeroutput">*it</code>,
 otherwise <code class="computeroutput">it</code>'<code class="computeroutput">
 == end()</code>.
 </li>
-<li>
+<li class="listitem">
Note: It is allowed that <code class="computeroutput">it</code> be a <code class="computeroutput">const_iterator</code>
 and the restored <code class="computeroutput">it</code>'
 an iterator, or viceversa.

Modified: trunk/libs/bimap/doc/html/boost_bimap/reference/set_of_reference.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/reference/set_of_reference.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/reference/set_of_reference.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -3,29 +3,28 @@
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>set_of Reference</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../reference.html" title="Reference">
<link rel="prev" href="bimap_reference.html" title="Bimap Reference">
-<link rel="next" href="unordered_set_of_reference.html" title="unordered_set_of
- Reference">
+<link rel="next" href="unordered_set_of_reference.html" title="unordered_set_of Reference">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="bimap_reference.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="unordered_set_of_reference.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="set_of Reference">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.reference.set_of_reference"></a>set_of Reference
+<a name="boost_bimap.reference.set_of_reference"></a><a class="link" href="set_of_reference.html" title="set_of Reference">set_of Reference</a>
</h3></div></div></div>
<div class="toc"><dl>
<dt><a href="set_of_reference.html#boost_bimap.reference.set_of_reference.header__boost_bimap_set_of_hpp__synopsis">Header
@@ -53,14 +52,12 @@
<dt>Serialization</dt>
</dl></dd>
</dl></div>
-<div class="section" lang="en">
+<div class="section" title='Header "boost/bimap/set_of.hpp" synopsis'>
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.reference.set_of_reference.header__boost_bimap_set_of_hpp__synopsis"></a><a href="set_of_reference.html#boost_bimap.reference.set_of_reference.header__boost_bimap_set_of_hpp__synopsis" title='Header
- "boost/bimap/set_of.hpp" synopsis'>Header
+<a name="boost_bimap.reference.set_of_reference.header__boost_bimap_set_of_hpp__synopsis"></a><a class="link" href="set_of_reference.html#boost_bimap.reference.set_of_reference.header__boost_bimap_set_of_hpp__synopsis" title='Header "boost/bimap/set_of.hpp" synopsis'>Header
 "boost/bimap/set_of.hpp" synopsis</a>
</h4></div></div></div>
-<pre class="programlisting">
-namespace boost {
+<pre class="programlisting">namespace boost {
namespace bimaps {

@@ -83,14 +80,12 @@
} // namespace boost
</pre>
</div>
-<div class="section" lang="en">
+<div class="section" title='Header "boost/bimap/multiset_of.hpp" synopsis'>
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.reference.set_of_reference.header__boost_bimap_multiset_of_hpp__synopsis"></a><a href="set_of_reference.html#boost_bimap.reference.set_of_reference.header__boost_bimap_multiset_of_hpp__synopsis" title='Header
- "boost/bimap/multiset_of.hpp" synopsis'>Header
+<a name="boost_bimap.reference.set_of_reference.header__boost_bimap_multiset_of_hpp__synopsis"></a><a class="link" href="set_of_reference.html#boost_bimap.reference.set_of_reference.header__boost_bimap_multiset_of_hpp__synopsis" title='Header "boost/bimap/multiset_of.hpp" synopsis'>Header
 "boost/bimap/multiset_of.hpp" synopsis</a>
</h4></div></div></div>
-<pre class="programlisting">
-namespace boost {
+<pre class="programlisting">namespace boost {
namespace bimaps {

@@ -113,10 +108,9 @@
} // namespace boost
</pre>
</div>
-<div class="section" lang="en">
+<div class="section" title="Collection type specifiers set_of and multiset_of">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.reference.set_of_reference.collection_type_specifiers_set_of_and_multiset_of"></a><a href="set_of_reference.html#boost_bimap.reference.set_of_reference.collection_type_specifiers_set_of_and_multiset_of" title="Collection
- type specifiers set_of and multiset_of">Collection
+<a name="boost_bimap.reference.set_of_reference.collection_type_specifiers_set_of_and_multiset_of"></a><a class="link" href="set_of_reference.html#boost_bimap.reference.set_of_reference.collection_type_specifiers_set_of_and_multiset_of" title="Collection type specifiers set_of and multiset_of">Collection
 type specifiers set_of and multiset_of</a>
</h4></div></div></div>

@@ -125,10 +119,9 @@
 coincide, so they are described together.
 
</div>
-<div class="section" lang="en">
+<div class="section" title="[multi]set_of Views">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views"></a><a href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views" title="[multi]set_of
- Views">[multi]set_of
+<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views"></a><a class="link" href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views" title="[multi]set_of Views">[multi]set_of
 Views</a>
</h4></div></div></div>
<div class="toc"><dl>
@@ -162,8 +155,7 @@
 If you look the bimap from a side, you will use a map view, and if you
 look at it as a whole, you will be using a set view.
 
-<pre class="programlisting">
-namespace boost {
+<pre class="programlisting">namespace boost {
namespace bimaps {
namespace views {

@@ -218,36 +210,36 @@

 // modifiers

- std::pair<iterator,bool> insert(const value_type & x);
+ std::pair<iterator,bool> <a class="link" href="set_of_reference.html#reference_set_of_insert_value">insert</a>(const value_type & x);

- iterator insert(iterator position, const value_type & x);
+ iterator <a class="link" href="set_of_reference.html#reference_set_of_insert_iterator_value">insert</a>(iterator position, const value_type & x);

 template< class InputIterator>
- void insert(InputIterator first, InputIterator last);
+ void <a class="link" href="set_of_reference.html#reference_set_of_insert_iterator_iterator">insert</a>(InputIterator first, InputIterator last);

- iterator erase(iterator position);
+ iterator <a class="link" href="set_of_reference.html#reference_set_of_erase_iterator">erase</a>(iterator position);

 template< class CompatibleKey >
- size_type erase(const CompatibleKey & x);
+ size_type <a class="link" href="set_of_reference.html#reference_set_of_erase_key">erase</a>(const CompatibleKey & x);

- iterator erase(iterator first, iterator last);
+ iterator <a class="link" href="set_of_reference.html#reference_set_of_erase_iterator_iterator">erase</a>(iterator first, iterator last);

- bool replace(iterator position, const value_type& x);
+ bool <a class="link" href="set_of_reference.html#reference_set_of_replace_iterator_value">replace</a>(iterator position, const value_type& x);

 // Only in map views
 // {

 template< class CompatibleKey >
- bool replace_key(iterator position, const CompatibleKey & x);
+ bool <a class="link" href="set_of_reference.html#reference_set_of_replace_key_iterator_key">replace_key</a>(iterator position, const CompatibleKey & x);

 template< class CompatibleData >
- bool replace_data(iterator position, const CompatibleData & x);
+ bool <a class="link" href="set_of_reference.html#reference_set_of_replace_data_iterator_data">replace_data</a>(iterator position, const CompatibleData & x);

 template< class KeyModifier >
- bool modify_key(iterator position, KeyModifier mod);
+ bool <a class="link" href="set_of_reference.html#reference_set_of_modify_key_iterator_modifier">modify_key</a>(iterator position, KeyModifier mod);

 template< class DataModifier >
- bool modify_data(iterator position, DataModifier mod);
+ bool <a class="link" href="set_of_reference.html#reference_set_of_modify_data_iterator_modifier">modify_data</a>(iterator position, DataModifier mod);

 // }

@@ -264,47 +256,47 @@
 // set operations

 template< class CompatibleKey >
- iterator find(const CompatibleKey & x);
+ iterator <a class="link" href="set_of_reference.html#reference_set_of_find_key">find</a>(const CompatibleKey & x);

 template< class CompatibleKey >
- const_iterator find(const CompatibleKey & x) const;
+ const_iterator <a class="link" href="set_of_reference.html#reference_set_of_find_key">find</a>(const CompatibleKey & x) const;

 template< class CompatibleKey >
- size_type count(const CompatibleKey & x) const;
+ size_type <a class="link" href="set_of_reference.html#reference_set_of_count_key">count</a>(const CompatibleKey & x) const;

 template< class CompatibleKey >
- iterator lower_bound(const CompatibleKey & x);
+ iterator <a class="link" href="set_of_reference.html#reference_set_of_lower_bound_key">lower_bound</a>(const CompatibleKey & x);

 template< class CompatibleKey >
- const_iterator lower_bound(const CompatibleKey & x) const;
+ const_iterator <a class="link" href="set_of_reference.html#reference_set_of_lower_bound_key">lower_bound</a>(const CompatibleKey & x) const;

 template< class CompatibleKey >
- iterator upper_bound(const CompatibleKey & x);
+ iterator <a class="link" href="set_of_reference.html#reference_set_of_upper_bound_key">upper_bound</a>(const CompatibleKey & x);

 template< class CompatibleKey >
- const_iterator upper_bound(const CompatibleKey & x) const;
+ const_iterator <a class="link" href="set_of_reference.html#reference_set_of_upper_bound_key">upper_bound</a>(const CompatibleKey & x) const;

 template< class CompatibleKey >
 std::pair<iterator,iterator>
- equal_range(const CompatibleKey & x);
+ <a class="link" href="set_of_reference.html#reference_set_of_equal_range_key">equal_range</a>(const CompatibleKey & x);

 template< class CompatibleKey >
 std::pair<const_iterator,const_iterator>
- equal_range(const CompatibleKey & x) const;
+ <a class="link" href="set_of_reference.html#reference_set_of_equal_range_key">equal_range</a>(const CompatibleKey & x) const;

 // Only in maps views
 // {

 template< class LowerBounder, class UpperBounder>
- std::pair<iterator,iterator> range(
+ std::pair<iterator,iterator> <a class="link" href="set_of_reference.html#reference_set_of_range_lower_upper">range</a>(
 LowerBounder lower, UpperBounder upper);

 template< class LowerBounder, class UpperBounder>
- std::pair<const_iterator,const_iterator> range(
+ std::pair<const_iterator,const_iterator> <a class="link" href="set_of_reference.html#reference_set_of_range_lower_upper">range</a>(
 LowerBounder lower, UpperBounder upper) const;

 typedef -unspecified- data_type;
@@ -313,16 +305,16 @@
 // {

 template< class CompatibleKey >
- const data_type & at(const CompatibleKey & k) const;
+ const data_type & <a class="link" href="set_of_reference.html#reference_set_of_at_key_const">at</a>(const CompatibleKey & k) const;

 // Only if the other collection type is mutable
 // {

 template< class CompatibleKey >
- data_type & operator[](const CompatibleKey & k);
+ data_type & <a class="link" href="set_of_reference.html#reference_set_of_operator_bracket_key">operator[]</a>(const CompatibleKey & k);

 template< class CompatibleKey >
- data_type & at(const CompatibleKey & k);
+ data_type & <a class="link" href="set_of_reference.html#reference_set_of_at_key">at</a>(const CompatibleKey & k);

 // }

@@ -330,10 +322,10 @@
 // {

 template< class CompatibleKey >
- info_type & info_at(const CompatibleKey & k);
+ info_type & <a class="link" href="set_of_reference.html#reference_set_of_info_at_key">info_at</a>(const CompatibleKey & k);

 template< class CompatibleKey >
- const info_type & info_at(const CompatibleKey & k) const;
+ const info_type & <a class="link" href="set_of_reference.html#reference_set_of_info_at_key">info_at</a>(const CompatibleKey & k) const;

 // }

@@ -361,15 +353,13 @@

 In the set view:
 
-<pre class="programlisting">
-typedef signature-compatible with relation< Left, ... > key_type;
+<pre class="programlisting">typedef signature-compatible with relation< Left, ... > key_type;
typedef signature-compatible with relation< const Left, ... > value_type;
</pre>

 In the left map view:
 
-<pre class="programlisting">
-typedef Left key_type;
+<pre class="programlisting">typedef Left key_type;
typedef ... data_type;

typedef signature-compatible with std::pair< const Left, ... > value_type;
@@ -377,73 +367,70 @@

 In the right map view:
 
-<pre class="programlisting">
-typedef ... key_type;
+<pre class="programlisting">typedef ... key_type;
typedef Left data_type;

typedef signature-compatible with std::pair< ... ,const Left > value_type;
</pre>
<a name="set_of_complexity_signature"></a>
 
-<div class="section" lang="en">
+<div class="section" title="Complexity signature">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.complexity_signature"></a><a href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.complexity_signature" title="Complexity
- signature">Complexity
+<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.complexity_signature"></a><a class="link" href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.complexity_signature" title="Complexity signature">Complexity
 signature</a>
</h5></div></div></div>

 Here and in the descriptions of operations of this view, we adopt the
- scheme outlined in the <a href="bimap_reference.html#complexity_signature_explanation">complexity
+ scheme outlined in the <a class="link" href="bimap_reference.html#complexity_signature_explanation">complexity
 signature section</a>. The complexity signature of [multi]set_of view
 is:
 
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 copying: <code class="computeroutput">c(n) = n * log(n)</code>,
 </li>
-<li>
+<li class="listitem">
 insertion: <code class="computeroutput">i(n) = log(n)</code>,
 </li>
-<li>
+<li class="listitem">
 hinted insertion: <code class="computeroutput">h(n) = 1</code> (constant) if the hint element precedes
 the point of insertion, <code class="computeroutput">h(n) = log(n)</code>
 otherwise,
 </li>
-<li>
+<li class="listitem">
 deletion: <code class="computeroutput">d(n) = 1</code> (amortized
 constant),
 </li>
-<li>
+<li class="listitem">
 replacement: <code class="computeroutput">r(n) = 1</code> (constant)
 if the element position does not change, <code class="computeroutput">r(n) = log(n)</code>
 otherwise,
 </li>
-<li>
+<li class="listitem">
 modifying: <code class="computeroutput">m(n) = 1</code> (constant)
 if the element position does not change, <code class="computeroutput">m(n) = log(n)</code>
 otherwise.
 </li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Instantiation types">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.instantiation_types"></a><a href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.instantiation_types" title="Instantiation
- types">Instantiation
+<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.instantiation_types"></a><a class="link" href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.instantiation_types" title="Instantiation types">Instantiation
 types</a>
</h5></div></div></div>

 Set views are instantiated internally to a <code class="computeroutput">bimap</code>.
 Instantiations are dependent on the following types:
 
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
<code class="computeroutput">Value</code> from the set
 specifier,
 </li>
-<li>
+<li class="listitem">
<code class="computeroutput">Allocator</code> from <code class="computeroutput">bimap</code>,
 </li>
-<li>
+<li class="listitem">
<code class="computeroutput">Compare</code> from the set
 specifier.
 </li>
@@ -453,55 +440,52 @@
 Weak Ordering</a> on elements of <code class="computeroutput">Value</code>.
 
</div>
-<div class="section" lang="en">
+<div class="section" title="Constructors, copy and assignment">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.constructors__copy_and_assignment"></a><a href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.constructors__copy_and_assignment" title="Constructors,
- copy and assignment">Constructors,
+<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.constructors__copy_and_assignment"></a><a class="link" href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.constructors__copy_and_assignment" title="Constructors, copy and assignment">Constructors,
 copy and assignment</a>
</h5></div></div></div>

 Set views do not have public constructors or destructors. Assignment,
 on the other hand, is provided.
 
-<pre class="programlisting">
-this_type & operator=(const this_type & x);
+<pre class="programlisting">this_type & operator=(const this_type & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: <code class="computeroutput">a
 = b;</code> where a and b are the <code class="computeroutput">bimap</code> objects to which <code class="computeroutput">*this</code>
 and x belong, respectively.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">*this</code>.
 </li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Modifiers">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.modifiers"></a>Modifiers
+<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.modifiers"></a><a class="link" href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.modifiers" title="Modifiers">Modifiers</a>
</h5></div></div></div>
<a name="reference_set_of_insert_value"></a>
 
-<pre class="programlisting">
-std::pair<iterator,bool> insert(const value_type & x);
+<pre class="programlisting">std::pair<iterator,bool> insert(const value_type & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: Inserts <code class="computeroutput">x</code>
 into the <code class="computeroutput">bimap</code> to which
 the set view belongs if
- <div class="itemizedlist"><ul type="circle">
-<li>
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
 the set view is non-unique OR no other element with equivalent
 key exists,
 </li>
-<li>
+<li class="listitem">
 AND insertion is allowed by the other set specifications the <code class="computeroutput">bimap</code>.
 </li>
</ul></div>
</li>
-<li>
+<li class="listitem">
Returns: The return value is a pair
 <code class="computeroutput">p</code>. <code class="computeroutput">p.second</code>
 is <code class="computeroutput">true</code> if and only if
@@ -510,60 +494,58 @@
 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.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
 O(I(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Strong.
 </li>
</ul></div>
<a name="reference_set_of_insert_iterator_value"></a>
 
-<pre class="programlisting">
-iterator insert(iterator position, const value_type & x);
+<pre class="programlisting">iterator insert(iterator position, const value_type & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view.
 </li>
-<li>
+<li class="listitem">
Effects: <code class="computeroutput">position</code>
 is used as a hint to improve the efficiency of the operation. Inserts
 <code class="computeroutput">x</code> into the <code class="computeroutput">bimap</code> to which the view belongs if
- <div class="itemizedlist"><ul type="circle">
-<li>
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
 the set view is non-unique OR no other element with equivalent
 key exists,
 </li>
-<li>
+<li class="listitem">
 AND insertion is allowed by all other views of the <code class="computeroutput">bimap</code>.
 </li>
</ul></div>
</li>
-<li>
+<li class="listitem">
Returns: On successful insertion,
 an iterator to the newly inserted element. Otherwise, an iterator to
 an element that caused the insertion to be banned. Note that more than
 one element can be causing insertion not to be allowed.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
 O(H(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Strong.
 </li>
</ul></div>
<a name="reference_set_of_insert_iterator_iterator"></a>
 
-<pre class="programlisting">
-template< class InputIterator >
+<pre class="programlisting">template< class InputIterator >
void insert(InputIterator first, InputIterator last);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">InputIterator</code>
 is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html" target="_top">Input
 Iterator</a> over elements of type <code class="computeroutput">value_type</code>
@@ -573,7 +555,7 @@
 to which this index belongs. <code class="computeroutput">last</code>
 is reachable from <code class="computeroutput">first</code>.
 </li>
-<li>
+<li class="listitem">
Effects: <code class="computeroutput">iterator
 hint =
 end()</code>;
@@ -585,129 +567,125 @@
 hint,
 *first++ );</code>
</li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
 O(m*H(n+m)), where m is the number of elements in <code class="computeroutput">[first,
 last)</code>.
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic.
 </li>
</ul></div>
<a name="reference_set_of_erase_iterator"></a>
 
-<pre class="programlisting">
-iterator erase(iterator position);
+<pre class="programlisting">iterator erase(iterator position);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid dereferenceable iterator if the set view.
 </li>
-<li>
+<li class="listitem">
Effects: Deletes the element pointed
 to by <code class="computeroutput">position</code>.
 </li>
-<li>
+<li class="listitem">
Returns: An iterator pointing to the
 element immediately following the one that was deleted, or <code class="computeroutput">end()</code>
 if no such element exists.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
 O(D(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: nothrow.
 </li>
</ul></div>
<a name="reference_set_of_erase_key"></a>
 
-<pre class="programlisting">
-template< class CompatibleKey >
+<pre class="programlisting">template< class CompatibleKey >
size_type erase(const CompatibleKey & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">CompatibleKey</code>
 is a compatible key of <code class="computeroutput">key_compare</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Deletes the elements with
 key equivalent to <code class="computeroutput">x</code>.
 </li>
-<li>
+<li class="listitem">
Returns: Number of elements deleted.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
 O(log(n) + m*D(n)), where m is the number of elements deleted.
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic.
 </li>
</ul></div>
<a name="reference_set_of_erase_iterator_iterator"></a>
 
-<pre class="programlisting">
-iterator erase(iterator first, iterator last);
+<pre class="programlisting">iterator erase(iterator first, iterator last);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">[first,last)</code>
 is a valid range of the view.
 </li>
-<li>
+<li class="listitem">
Effects: Deletes the elements in
 <code class="computeroutput">[first,last)</code>.
 </li>
-<li>
+<li class="listitem">
Returns: last.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
 O(log(n) + m*D(n)), where m is the number of elements in <code class="computeroutput">[first,last)</code>.
 </li>
-<li>
+<li class="listitem">
Exception safety: nothrow.
 </li>
</ul></div>
<a name="reference_set_of_replace_iterator_value"></a>
 
-<pre class="programlisting">
-bool replace(iterator position, const value_type& x);
+<pre class="programlisting">bool replace(iterator position, const value_type& x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid dereferenceable iterator of the set view.
 </li>
-<li>
+<li class="listitem">
Effects: Assigns the value <code class="computeroutput">x</code> to the element pointed to by <code class="computeroutput">position</code> into the <code class="computeroutput">bimap</code>
- to which the set view belongs if, for the value <code class="computeroutput">x</code><div class="itemizedlist"><ul type="circle">
-<li>
+ to which the set view belongs if, for the value <code class="computeroutput">x</code><div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
 the set view is non-unique OR no other element with equivalent
 key exists (except possibly <code class="computeroutput">*position</code>),
 </li>
-<li>
+<li class="listitem">
 AND replacing is allowed by all other views of the <code class="computeroutput">bimap</code>.
 </li>
</ul></div>
</li>
-<li>
+<li class="listitem">
Postconditions: Validity of position
 is preserved in all cases.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">true</code>
 if the replacement took place, <code class="computeroutput">false</code>
 otherwise.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
 O(R(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Strong. If an exception
 is thrown by some user-provided operation, the <code class="computeroutput">bimap</code>
 to which the set view belongs remains in its original state.
@@ -715,46 +693,45 @@
</ul></div>
<a name="reference_set_of_replace_key_iterator_key"></a>
 
-<pre class="programlisting">
-template< class CompatibleKey >
+<pre class="programlisting">template< class CompatibleKey >
bool replace_key(iterator position, const CompatibleKey & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid dereferenceable iterator of the set view. <code class="computeroutput">CompatibleKey</code> can be assigned to
 <code class="computeroutput">key_type</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Assigns the value <code class="computeroutput">x</code> to <code class="computeroutput">e.first</code>,
 where <code class="computeroutput">e</code> is the element
 pointed to by <code class="computeroutput">position</code>
 into the <code class="computeroutput">bimap</code> to which
 the set view belongs if,
- <div class="itemizedlist"><ul type="circle">
-<li>
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
 the map view is non-unique OR no other element with equivalent
 key exists (except possibly <code class="computeroutput">*position</code>),
 </li>
-<li>
+<li class="listitem">
 AND replacing is allowed by all other views of the <code class="computeroutput">bimap</code>.
 </li>
</ul></div>
</li>
-<li>
+<li class="listitem">
Postconditions: Validity of position
 is preserved in all cases.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">true</code>
 if the replacement took place, <code class="computeroutput">false</code>
 otherwise.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
 O(R(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Strong. If an exception
 is thrown by some user-provided operation, the <code class="computeroutput">bimap</code>
 to which the set view belongs remains in its original state.
@@ -762,46 +739,45 @@
</ul></div>
<a name="reference_set_of_replace_data_iterator_data"></a>
 
-<pre class="programlisting">
-template< class CompatibleData >
+<pre class="programlisting">template< class CompatibleData >
bool replace_data(iterator position, const CompatibleData & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid dereferenceable iterator of the set view. <code class="computeroutput">CompatibleKey</code> can be assigned to
 <code class="computeroutput">data_type</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Assigns the value <code class="computeroutput">x</code> to <code class="computeroutput">e.second</code>,
 where <code class="computeroutput">e</code> is the element
 pointed to by <code class="computeroutput">position</code>
 into the <code class="computeroutput">bimap</code> to which
 the set view belongs if,
- <div class="itemizedlist"><ul type="circle">
-<li>
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
 the map view is non-unique OR no other element with equivalent
 key exists (except possibly <code class="computeroutput">*position</code>),
 </li>
-<li>
+<li class="listitem">
 AND replacing is allowed by all other views of the <code class="computeroutput">bimap</code>.
 </li>
</ul></div>
</li>
-<li>
+<li class="listitem">
Postconditions: Validity of position
 is preserved in all cases.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">true</code>
 if the replacement took place, <code class="computeroutput">false</code>
 otherwise.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
 O(R(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Strong. If an exception
 is thrown by some user-provided operation, the <code class="computeroutput">bimap</code>
 to which the set view belongs remains in its original state.
@@ -809,109 +785,106 @@
</ul></div>
<a name="reference_set_of_modify_key_iterator_modifier"></a>
 
-<pre class="programlisting">
-template< class KeyModifier >
+<pre class="programlisting">template< class KeyModifier >
bool modify_key(iterator position, KeyModifier mod);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">KeyModifier</code>
 is a model of <a href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">Unary
 Function</a> accepting arguments of type: <code class="computeroutput">key_type&</code>; <code class="computeroutput">position</code>
 is a valid dereferenceable iterator of the view.
 </li>
-<li>
+<li class="listitem">
Effects: Calls <code class="computeroutput">mod(e.first)</code> where e is the element pointed to
 by position and rearranges <code class="computeroutput">*position</code> into all the views of the
 <code class="computeroutput">bimap</code>. If the rearrangement
 fails, the element is erased. Rearrangement is successful if
- <div class="itemizedlist"><ul type="circle">
-<li>
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
 the map view is non-unique OR no other element with equivalent
 key exists,
 </li>
-<li>
+<li class="listitem">
 AND rearrangement is allowed by all other views of the <code class="computeroutput">bimap</code>.
 </li>
</ul></div>
</li>
-<li>
+<li class="listitem">
Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
 succeeds.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">true</code>
 if the operation succeeded, <code class="computeroutput">false</code>
 otherwise.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
 O(M(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic. If an exception
 is thrown by some user-provided operation (except possibly mod), then
 the element pointed to by position is erased.
 </li>
-<li>
+<li class="listitem">
Note: Only provided for map views.
 </li>
</ul></div>
<a name="reference_set_of_modify_data_iterator_modifier"></a>
 
-<pre class="programlisting">
-template< class DataModifier >
+<pre class="programlisting">template< class DataModifier >
bool modify_data(iterator position, DataModifier mod);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">DataModifier</code>
 is a model of <a href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">Unary
 Function</a> accepting arguments of type: <code class="computeroutput">data_type&</code>; <code class="computeroutput">position</code>
 is a valid dereferenceable iterator of the view.
 </li>
-<li>
+<li class="listitem">
Effects: Calls <code class="computeroutput">mod(e.second)</code> where e is the element pointed to
 by position and rearranges <code class="computeroutput">*position</code> into all the views of the
 <code class="computeroutput">bimap</code>. If the rearrangement
 fails, the element is erased. Rearrangement is successful if
- <div class="itemizedlist"><ul type="circle">
-<li>
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
 the oppositte map view is non-unique OR no other element with equivalent
 key in that view exists,
 </li>
-<li>
+<li class="listitem">
 AND rearrangement is allowed by all other views of the <code class="computeroutput">bimap</code>.
 </li>
</ul></div>
</li>
-<li>
+<li class="listitem">
Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
 succeeds.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">true</code>
 if the operation succeeded, <code class="computeroutput">false</code>
 otherwise.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
 O(M(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic. If an exception
 is thrown by some user-provided operation (except possibly mod), then
 the element pointed to by position is erased.
 </li>
-<li>
+<li class="listitem">
Note: Only provided for map views.
 </li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Set operations">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.set_operations"></a><a href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.set_operations" title="Set
- operations">Set
+<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.set_operations"></a><a class="link" href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.set_operations" title="Set operations">Set
 operations</a>
</h5></div></div></div>

@@ -935,99 +908,94 @@
 
<a name="reference_set_of_find_key"></a>
 
-<pre class="programlisting">
-template< class CompatibleKey >
+<pre class="programlisting">template< class CompatibleKey >
iterator find(const CompatibleKey & x);

template< class CompatibleKey >
const_iterator find(const CompatibleKey & x) const;
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">CompatibleKey</code>
 is a compatible key of <code class="computeroutput">key_compare</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Returns a pointer to an element
 whose key is equivalent to <code class="computeroutput">x</code>,
 or <code class="computeroutput">end()</code>
 if such an element does not exist.
 </li>
-<li>
+<li class="listitem">
Complexity: O(log(n)).
 </li>
</ul></div>
<a name="reference_set_of_count_key"></a>
 
-<pre class="programlisting">
-template< class CompatibleKey >
+<pre class="programlisting">template< class CompatibleKey >
size_type count(const key_type & x) const;
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">CompatibleKey</code>
 is a compatible key of <code class="computeroutput">key_compare</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Returns the number of elements
 with key equivalent to <code class="computeroutput">x</code>.
 </li>
-<li>
+<li class="listitem">
Complexity: O(log(n) + count(x)).
 </li>
</ul></div>
<a name="reference_set_of_lower_bound_key"></a>
 
-<pre class="programlisting">
-template< class CompatibleKey >
+<pre class="programlisting">template< class CompatibleKey >
iterator lower_bound(const key_type & x);

template< class CompatibleKey >
const_iterator lower_bound(const key_type & x) const;
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">CompatibleKey</code>
 is a compatible key of <code class="computeroutput">key_compare</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Returns an iterator pointing
 to the first element with key not less than <code class="computeroutput">x</code>,
 or <code class="computeroutput">end()</code>
 if such an element does not exist.
 </li>
-<li>
+<li class="listitem">
Complexity: O(log(n)).
 </li>
</ul></div>
<a name="reference_set_of_upper_bound_key"></a>
 
-<pre class="programlisting">
-template< class CompatibleKey >
+<pre class="programlisting">template< class CompatibleKey >
iterator upper_bound(const key_type & x);

template< class CompatibleKey >
const_iterator upper_bound(const key_type & x) const;
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">CompatibleKey</code>
 is a compatible key of <code class="computeroutput">key_compare</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Returns an iterator pointing
 to the first element with key greater than <code class="computeroutput">x</code>,
 or <code class="computeroutput">end()</code>
 if such an element does not exist.
 </li>
-<li>
+<li class="listitem">
Complexity: O(log(n)).
 </li>
</ul></div>
<a name="reference_set_of_equal_range_key"></a>
 
-<pre class="programlisting">
-template< class CompatibleKey >
+<pre class="programlisting">template< class CompatibleKey >
std::pair<iterator,iterator>
 equal_range(const key_type & x);

@@ -1035,23 +1003,22 @@
std::pair<const_iterator,const_iterator>
 equal_range(const key_type & x) const;
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">CompatibleKey</code>
 is a compatible key of <code class="computeroutput">key_compare</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Equivalent to <code class="computeroutput">make_pair(lower_bound(x),upper_bound(x))</code>.
 </li>
-<li>
+<li class="listitem">
Complexity: O(log(n)).
 </li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Range operations">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.range_operations"></a><a href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.range_operations" title="Range
- operations">Range
+<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.range_operations"></a><a class="link" href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.range_operations" title="Range operations">Range
 operations</a>
</h5></div></div></div>

@@ -1068,12 +1035,12 @@
 is said to be a lower bounder of <code class="computeroutput">Compare</code>
 if
 
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
<code class="computeroutput">LowerBounder</code> is a
 <code class="computeroutput">Predicate</code> over <code class="computeroutput">Key</code>,
 </li>
-<li>
+<li class="listitem">
 if <code class="computeroutput">lower(k1)</code>
 and <code class="computeroutput">!comp(k2,k1)</code> then <code class="computeroutput">lower(k2)</code>,
 </li>
@@ -1085,12 +1052,12 @@
 Similarly, an upper bounder is a type <code class="computeroutput">UpperBounder</code>
 such that
 
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
<code class="computeroutput">UpperBounder</code> is a
 <code class="computeroutput">Predicate</code> over <code class="computeroutput">Key</code>,
 </li>
-<li>
+<li class="listitem">
 if <code class="computeroutput">upper(k1)</code>
 and <code class="computeroutput">!comp(k1,k2)</code> then <code class="computeroutput">upper(k2)</code>,
 </li>
@@ -1102,66 +1069,63 @@
 
<a name="reference_set_of_range_lower_upper"></a>
 
-<pre class="programlisting">
-template< class LowerBounder, class UpperBounder>
+<pre class="programlisting">template< class LowerBounder, class UpperBounder>
std::pair<const_iterator,const_iterator> range(
 LowerBounder lower, UpperBounder upper) const;
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">LowerBounder</code>
 and <code class="computeroutput">UpperBounder</code> are
 a lower and upper bounder of <code class="computeroutput">key_compare</code>,
 respectively.
 </li>
-<li>
+<li class="listitem">
Effects: Returns a pair of iterators
 pointing to the beginning and one past the end of the subsequence of
 elements satisfying lower and upper simultaneously. If no such elements
 exist, the iterators both point to the first element satisfying lower,
 or else are equal to <code class="computeroutput">end()</code> if this latter element does not exist.
 </li>
-<li>
+<li class="listitem">
Complexity: O(log(n)).
 </li>
-<li>
+<li class="listitem">
Variants: In place of lower or upper
 (or both), the singular value <code class="computeroutput">boost::bimap::unbounded</code>
 can be provided. This acts as a predicate which all values of type
 <code class="computeroutput">key_type</code> satisfy.
 </li>
-<li>
+<li class="listitem">
Note: Only provided for map views.
 </li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="at(), info_at() and operator[] - set_of only">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.at____info_at___and_operator_______set_of_only"></a><a href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.at____info_at___and_operator_______set_of_only" title="at(),
- info_at() and operator[] - set_of only">at(),
+<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.at____info_at___and_operator_______set_of_only"></a><a class="link" href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.at____info_at___and_operator_______set_of_only" title="at(), info_at() and operator[] - set_of only">at(),
 info_at() and operator[] - set_of only</a>
</h5></div></div></div>
<a name="reference_set_of_at_key_const"></a>
 
-<pre class="programlisting">
-template< class CompatibleKey >
+<pre class="programlisting">template< class CompatibleKey >
const data_type & at(const CompatibleKey & k) const;
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">CompatibleKey</code>
 is a compatible key of <code class="computeroutput">key_compare</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Returns the <code class="computeroutput">data_type</code> reference that is associated
 with <code class="computeroutput">k</code>, or throws
 <code class="computeroutput">std::out_of_range</code> if such key does not
 exist.
 </li>
-<li>
+<li class="listitem">
Complexity: O(log(n)).
 </li>
-<li>
+<li class="listitem">
Note: Only provided when <code class="computeroutput">set_of</code> is used.
 </li>
</ul></div>
@@ -1173,84 +1137,81 @@
 
<a name="reference_set_of_operator_bracket_key"></a>
 
-<pre class="programlisting">
-template< class CompatibleKey >
+<pre class="programlisting">template< class CompatibleKey >
data_type & operator[](const CompatibleKey & k);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">CompatibleKey</code>
 is a compatible key of <code class="computeroutput">key_compare</code>.
 </li>
-<li>
+<li class="listitem">
Effects: <code class="computeroutput">return
 insert(value_type(k,data_type()))->second;</code>
</li>
-<li>
+<li class="listitem">
Complexity: O(log(n)).
 </li>
-<li>
+<li class="listitem">
Note: Only provided when <code class="computeroutput">set_of</code> is used and the other collection
 type is mutable.
 </li>
</ul></div>
<a name="reference_set_of_at_key"></a>
 
-<pre class="programlisting">
-template< class CompatibleKey >
+<pre class="programlisting">template< class CompatibleKey >
data_type & at(const CompatibleKey & k);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">CompatibleKey</code>
 is a compatible key of <code class="computeroutput">key_compare</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Returns the <code class="computeroutput">data_type</code> reference that is associated
 with <code class="computeroutput">k</code>, or throws
 <code class="computeroutput">std::out_of_range</code> if such key does not
 exist.
 </li>
-<li>
+<li class="listitem">
Complexity: O(log(n)).
 </li>
-<li>
+<li class="listitem">
Note: Only provided when <code class="computeroutput">set_of</code> is used and the other collection
 type is mutable.
 </li>
</ul></div>
<a name="reference_set_of_info_at_key"></a>
 
-<pre class="programlisting">
-template< class CompatibleKey >
+<pre class="programlisting">template< class CompatibleKey >
info_type & info_at(const CompatibleKey & k);

template< class CompatibleKey >
const info_type & info_at(const CompatibleKey & k) const;
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">CompatibleKey</code>
 is a compatible key of <code class="computeroutput">key_compare</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Returns the <code class="computeroutput">info_type</code> reference that is associated
 with <code class="computeroutput">k</code>, or throws
 <code class="computeroutput">std::out_of_range</code> if such key does not
 exist.
 </li>
-<li>
+<li class="listitem">
Complexity: O(log(n)).
 </li>
-<li>
+<li class="listitem">
Note: Only provided when <code class="computeroutput">set_of</code> and <code class="computeroutput">info_hook</code>
 are used
 </li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Serialization">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.serialization"></a>Serialization
+<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.serialization"></a><a class="link" href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.serialization" title="Serialization">Serialization</a>
</h5></div></div></div>

 Views cannot be serialized on their own, but only as part of the <code class="computeroutput">bimap</code> into which they are embedded.
@@ -1260,26 +1221,32 @@
 use the concepts defined in the <code class="computeroutput">bimap</code>
 serialization section.
 
-<div class="sidebar">
+<div class="sidebar">
+
+
 Operation: saving of a <code class="computeroutput">bimap</code> m to an output archive (XML archive)
 ar.
- </div>
-<div class="itemizedlist"><ul type="disc"><li>
+ 
+</div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
Requires: No additional requirements
 to those imposed by the container.
 </li></ul></div>
-<div class="sidebar">
+<div class="sidebar">
+
+
 Operation: loading of a <code class="computeroutput">bimap</code> m' from an input archive (XML
 archive) ar.
- </div>
-<div class="itemizedlist"><ul type="disc">
-<li>
+ 
+</div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: In addition to the general
 requirements, <code class="computeroutput">value_comp()</code> must be serialization-compatible
 with <code class="computeroutput">m.get<i>().value_comp()</code>,
 where i is the position of the ordered view in the container.
 </li>
-<li>
+<li class="listitem">
Postconditions: On successful loading,
 each of the elements of <code class="computeroutput">[begin(),
 end())</code>
@@ -1287,29 +1254,35 @@
 m.get<i>().end())</code>.
 </li>
</ul></div>
-<div class="sidebar">
+<div class="sidebar">
+
+
 Operation: saving of an iterator or
 <code class="computeroutput">const_iterator</code> it to
 an output archive (XML archive) ar.
- </div>
-<div class="itemizedlist"><ul type="disc"><li>
+ 
+</div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
Requires: <code class="computeroutput">it</code>
 is a valid iterator of the view. The associated <code class="computeroutput">bimap</code>
 has been previously saved.
 </li></ul></div>
-<div class="sidebar">
+<div class="sidebar">
+
+
 Operation: loading of an <code class="computeroutput">iterator</code> or <code class="computeroutput">const_iterator</code>
 <code class="computeroutput">it</code>' from an input archive
 ( XML archive) ar.
- </div>
-<div class="itemizedlist"><ul type="disc">
-<li>
+ 
+</div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Postconditions: On successful loading,
 if it was dereferenceable then <code class="computeroutput">*it</code>' is the restored copy of <code class="computeroutput">*it</code>,
 otherwise <code class="computeroutput">it</code>'<code class="computeroutput">
 == end()</code>.
 </li>
-<li>
+<li class="listitem">
Note: It is allowed that it be a
 <code class="computeroutput">const_iterator</code> and
 the restored <code class="computeroutput">it</code>' an

Modified: trunk/libs/bimap/doc/html/boost_bimap/reference/unconstrained_set_of_reference.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/reference/unconstrained_set_of_reference.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/reference/unconstrained_set_of_reference.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -1,33 +1,30 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>unconstrained_set_of
- Reference</title>
+<title>unconstrained_set_of Reference</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="vector_of_reference.html" title="vector_of
- Reference">
+<link rel="prev" href="vector_of_reference.html" title="vector_of Reference">
<link rel="next" href="../compiler_specifics.html" title="Compiler specifics">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="vector_of_reference.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../compiler_specifics.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="unconstrained_set_of Reference">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.reference.unconstrained_set_of_reference"></a><a href="unconstrained_set_of_reference.html" title="unconstrained_set_of
- Reference">unconstrained_set_of
+<a name="boost_bimap.reference.unconstrained_set_of_reference"></a><a class="link" href="unconstrained_set_of_reference.html" title="unconstrained_set_of Reference">unconstrained_set_of
 Reference</a>
</h3></div></div></div>
<div class="toc"><dl>
@@ -41,14 +38,12 @@
<dt>Serialization</dt>
</dl></dd>
</dl></div>
-<div class="section" lang="en">
+<div class="section" title='Header "boost/bimap/unconstrained_set_of.hpp" synopsis'>
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.reference.unconstrained_set_of_reference.header__boost_bimap_unconstrained_set_of_hpp__synopsis"></a><a href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.header__boost_bimap_unconstrained_set_of_hpp__synopsis" title='Header
- "boost/bimap/unconstrained_set_of.hpp" synopsis'>Header
+<a name="boost_bimap.reference.unconstrained_set_of_reference.header__boost_bimap_unconstrained_set_of_hpp__synopsis"></a><a class="link" href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.header__boost_bimap_unconstrained_set_of_hpp__synopsis" title='Header "boost/bimap/unconstrained_set_of.hpp" synopsis'>Header
 "boost/bimap/unconstrained_set_of.hpp" synopsis</a>
</h4></div></div></div>
-<pre class="programlisting">
-namespace boost {
+<pre class="programlisting">namespace boost {
namespace bimaps {

@@ -62,10 +57,9 @@
} // namespace boost
</pre>
</div>
-<div class="section" lang="en">
+<div class="section" title="unconstrained_set_of Views">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views"></a><a href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views" title="unconstrained_set_of
- Views">unconstrained_set_of
+<a name="boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views"></a><a class="link" href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views" title="unconstrained_set_of Views">unconstrained_set_of
 Views</a>
</h4></div></div></div>
<div class="toc"><dl>
@@ -78,8 +72,7 @@
 of these kind of view boost the bimap performance but the view can not
 be accessed. An unconstrained view is an empty class.
 
-<pre class="programlisting">
-namespace boost {
+<pre class="programlisting">namespace boost {
namespace bimaps {
namespace views {

@@ -99,15 +92,13 @@

 In the set view:
 
-<pre class="programlisting">
-typedef signature-compatible with relation< Left, ... > key_type;
+<pre class="programlisting">typedef signature-compatible with relation< Left, ... > key_type;
typedef signature-compatible with relation< Left, ... > value_type;
</pre>

 In the left map view:
 
-<pre class="programlisting">
-typedef Left key_type;
+<pre class="programlisting">typedef Left key_type;
typedef ... data_type;

typedef signature-compatible with std::pair< Left, ... > value_type;
@@ -115,50 +106,48 @@

 In the right map view:
 
-<pre class="programlisting">
-typedef ... key_type;
+<pre class="programlisting">typedef ... key_type;
typedef Left data_type;

typedef signature-compatible with std::pair< ... , Left > value_type;
</pre>
<a name="unconstrained_set_of_complexity_signature"></a>
 
-<div class="section" lang="en">
+<div class="section" title="Complexity signature">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.complexity_signature"></a><a href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.complexity_signature" title="Complexity
- signature">Complexity
+<a name="boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.complexity_signature"></a><a class="link" href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.complexity_signature" title="Complexity signature">Complexity
 signature</a>
</h5></div></div></div>

- We adopt the scheme outlined in the <a href="bimap_reference.html#complexity_signature_explanation">complexity
+ We adopt the scheme outlined in the <a class="link" href="bimap_reference.html#complexity_signature_explanation">complexity
 signature section</a>. An unconstrained view can not be accessed by
 the user, but the formulas to find the order of an operation for a bimap
 hold with the following definitions. The complexity signature of a <code class="computeroutput">unconstrained_set_of</code> view is:
 
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 copying: <code class="computeroutput">c(n) = 0</code>
</li>
-<li>
+<li class="listitem">
 insertion: <code class="computeroutput">i(n) = 0</code>
</li>
-<li>
+<li class="listitem">
 hinted insertion: <code class="computeroutput">h(n) = 0</code>
</li>
-<li>
+<li class="listitem">
 deletion: <code class="computeroutput">d(n) = 0</code>
</li>
-<li>
+<li class="listitem">
 replacement: <code class="computeroutput">r(n) = 0</code>
</li>
-<li>
+<li class="listitem">
 modifying: <code class="computeroutput">m(n) = 0</code>
</li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Serialization">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.serialization"></a>Serialization
+<a name="boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.serialization"></a><a class="link" href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.serialization" title="Serialization">Serialization</a>
</h5></div></div></div>

 Views cannot be serialized on their own, but only as part of the <code class="computeroutput">bimap</code> into which they are embedded.
@@ -168,19 +157,25 @@
 defined in the <code class="computeroutput">bimap</code>
 serialization section.
 
-<div class="sidebar">
+<div class="sidebar">
+
+
 Operation: saving of a <code class="computeroutput">bimap</code> b to an output archive (XML archive)
 ar.
- </div>
-<div class="itemizedlist"><ul type="disc"><li>
+ 
+</div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
Requires: No additional requirements
 to those imposed by the container.
 </li></ul></div>
-<div class="sidebar">
+<div class="sidebar">
+
+
 Operation: loading of a <code class="computeroutput">bimap</code> b' from an input archive (XML
 archive) ar.
- </div>
-<div class="itemizedlist"><ul type="disc"><li>
+ 
+</div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
Requires: No additional requirements
 to those imposed by the container.
 </li></ul></div>

Modified: trunk/libs/bimap/doc/html/boost_bimap/reference/unordered_set_of_reference.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/reference/unordered_set_of_reference.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/reference/unordered_set_of_reference.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -1,11 +1,10 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>unordered_set_of
- Reference</title>
+<title>unordered_set_of Reference</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../reference.html" title="Reference">
<link rel="prev" href="set_of_reference.html" title="set_of Reference">
<link rel="next" href="list_of_reference.html" title="list_of Reference">
@@ -13,20 +12,19 @@
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="set_of_reference.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="list_of_reference.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="unordered_set_of Reference">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.reference.unordered_set_of_reference"></a><a href="unordered_set_of_reference.html" title="unordered_set_of
- Reference">unordered_set_of
+<a name="boost_bimap.reference.unordered_set_of_reference"></a><a class="link" href="unordered_set_of_reference.html" title="unordered_set_of Reference">unordered_set_of
 Reference</a>
</h3></div></div></div>
<div class="toc"><dl>
@@ -56,14 +54,12 @@
<dt>Serialization</dt>
</dl></dd>
</dl></div>
-<div class="section" lang="en">
+<div class="section" title='Header "boost/bimap/unordered_set_of.hpp" synopsis'>
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.reference.unordered_set_of_reference.header__boost_bimap_unordered_set_of_hpp__synopsis"></a><a href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.header__boost_bimap_unordered_set_of_hpp__synopsis" title='Header
- "boost/bimap/unordered_set_of.hpp" synopsis'>Header
+<a name="boost_bimap.reference.unordered_set_of_reference.header__boost_bimap_unordered_set_of_hpp__synopsis"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.header__boost_bimap_unordered_set_of_hpp__synopsis" title='Header "boost/bimap/unordered_set_of.hpp" synopsis'>Header
 "boost/bimap/unordered_set_of.hpp" synopsis</a>
</h4></div></div></div>
-<pre class="programlisting">
-namespace boost {
+<pre class="programlisting">namespace boost {
namespace bimaps {

@@ -88,14 +84,12 @@
} // namespace boost
</pre>
</div>
-<div class="section" lang="en">
+<div class="section" title='Header "boost/bimap/unordered_multiset_of.hpp" synopsis'>
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.reference.unordered_set_of_reference.header__boost_bimap_unordered_multiset_of_hpp__synopsis"></a><a href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.header__boost_bimap_unordered_multiset_of_hpp__synopsis" title='Header
- "boost/bimap/unordered_multiset_of.hpp" synopsis'>Header
+<a name="boost_bimap.reference.unordered_set_of_reference.header__boost_bimap_unordered_multiset_of_hpp__synopsis"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.header__boost_bimap_unordered_multiset_of_hpp__synopsis" title='Header "boost/bimap/unordered_multiset_of.hpp" synopsis'>Header
 "boost/bimap/unordered_multiset_of.hpp" synopsis</a>
</h4></div></div></div>
-<pre class="programlisting">
-namespace boost {
+<pre class="programlisting">namespace boost {
namespace bimaps {

@@ -120,10 +114,9 @@
} // namespace boost
</pre>
</div>
-<div class="section" lang="en">
+<div class="section" title="Collection type specifiers unordered_set_of and unordered_multiset_of">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.reference.unordered_set_of_reference.collection_type_specifiers_unordered_set_of_and_unordered_multiset_of"></a><a href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.collection_type_specifiers_unordered_set_of_and_unordered_multiset_of" title="Collection
- type specifiers unordered_set_of and unordered_multiset_of">Collection
+<a name="boost_bimap.reference.unordered_set_of_reference.collection_type_specifiers_unordered_set_of_and_unordered_multiset_of"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.collection_type_specifiers_unordered_set_of_and_unordered_multiset_of" title="Collection type specifiers unordered_set_of and unordered_multiset_of">Collection
 type specifiers unordered_set_of and unordered_multiset_of</a>
</h4></div></div></div>

@@ -132,10 +125,9 @@
 coincide, thus we describe them in a grouped manner.
 
</div>
-<div class="section" lang="en">
+<div class="section" title="unordered_[multi]set_of Views">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views"></a><a href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views" title="unordered_[multi]set_of
- Views">unordered_[multi]set_of
+<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views" title="unordered_[multi]set_of Views">unordered_[multi]set_of
 Views</a>
</h4></div></div></div>
<div class="toc"><dl>
@@ -190,8 +182,7 @@
 in the concepts modeled or do not exactly conform to the requirements for
 unordered associative containers.
 
-<pre class="programlisting">
-namespace boost {
+<pre class="programlisting">namespace boost {
namespace bimap {
namespace views {

@@ -243,36 +234,36 @@

 // modifiers

- std::pair< iterator, bool > insert(const value_type & x);
+ std::pair< iterator, bool > <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_insert_value">insert</a>(const value_type & x);

- iterator insert(iterator position, const value_type & x);
+ iterator <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_insert_iterator_value">insert</a>(iterator position, const value_type & x);

 template< class InputIterator >
- void insert(InputIterator first, InputIterator last);
+ void <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_insert_iterator_iterator">insert</a>(InputIterator first, InputIterator last);

- iterator erase(iterator position);
+ iterator <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_erase_iterator">erase</a>(iterator position);

 template< class CompatibleKey >
- size_type erase(const CompatibleKey & x);
+ size_type <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_erase_key">erase</a>(const CompatibleKey & x);

- iterator erase(iterator first, iterator last);
+ iterator <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_erase_iterator_iterator">erase</a>(iterator first, iterator last);

- bool replace(iterator position, const value_type & x);
+ bool <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_replace_iterator_value">replace</a>(iterator position, const value_type & x);

 // Only in map views
 // {

 template< class CompatibleKey >
- bool replace_key(iterator position, const CompatibleKey & x);
+ bool <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_replace_key_iterator_key">replace_key</a>(iterator position, const CompatibleKey & x);

 template< class CompatibleData >
- bool replace_data(iterator position, const CompatibleData & x);
+ bool <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_replace_data_iterator_data">replace_data</a>(iterator position, const CompatibleData & x);

 template< class KeyModifier >
- bool modify_key(iterator position, KeyModifier mod);
+ bool <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_modify_key_iterator_modifier">modify_key</a>(iterator position, KeyModifier mod);

 template< class DataModifier >
- bool modify_data(iterator position, DataModifier mod);
+ bool <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_modify_data_iterator_modifier">modify_data</a>(iterator position, DataModifier mod);

 // }

@@ -288,21 +279,21 @@
 // lookup

 template< class CompatibleKey >
- iterator find(const CompatibleKey & x);
+ iterator <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_find_key">find</a>(const CompatibleKey & x);

 template< class CompatibleKey >
- const_iterator find(const CompatibleKey & x) const;
+ const_iterator <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_find_key">find</a>(const CompatibleKey & x) const;

 template< class CompatibleKey >
- size_type count(const CompatibleKey & x) const;
+ size_type <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_count_key">count</a>(const CompatibleKey & x) const;

 template< class CompatibleKey >
 std::pair<iterator,iterator>
- equal_range(const CompatibleKey & x);
+ <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_equal_range_key">equal_range</a>(const CompatibleKey & x);

 template< class CompatibleKey >
 std::pair<const_iterator,const_iterator>
- equal_range(const CompatibleKey & x) const;
+ <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_equal_range_key">equal_range</a>(const CompatibleKey & x) const;

 // bucket interface

@@ -321,7 +312,7 @@
 float load_factor() const;
 float max_load_factor() const;
 void max_load_factor(float z);
- void rehash(size_type n);
+ void <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_rehash_size">rehash</a>(size_type n);

 // Only in maps views
 // {
@@ -332,16 +323,16 @@
 // {

 template<class CompatibleKey>
- const data_type & at(const CompatibleKey & k) const;
+ const data_type & <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_at_key_const">at</a>(const CompatibleKey & k) const;

 // Only if the other collection type is mutable
 // {

 template<class CompatibleKey>
- data_type & operator[](const CompatibleKey & k);
+ data_type & <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_operator_bracket_key">operator[]</a>(const CompatibleKey & k);

 template<class CompatibleKey>
- data_type & at(const CompatibleKey & k);
+ data_type & <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_at_key">at</a>(const CompatibleKey & k);

 // }

@@ -349,10 +340,10 @@
 // {

 template< class CompatibleKey >
- info_type & info_at(const CompatibleKey & k);
+ info_type & <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_info_at_key">info_at</a>(const CompatibleKey & k);

 template< class CompatibleKey >
- const info_type & info_at(const CompatibleKey & k) const;
+ const info_type & <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_info_at_key">info_at</a>(const CompatibleKey & k) const;

 // }

@@ -370,15 +361,13 @@

 In the set view:
 
-<pre class="programlisting">
-typedef signature-compatible with relation< Left, ... > key_type;
+<pre class="programlisting">typedef signature-compatible with relation< Left, ... > key_type;
typedef signature-compatible with relation< const Left, ... > value_type;
</pre>

 In the left map view:
 
-<pre class="programlisting">
-typedef Left key_type;
+<pre class="programlisting">typedef Left key_type;
typedef ... data_type;

typedef signature-compatible with std::pair< const Left, ... > value_type;
@@ -386,62 +375,59 @@

 In the right map view:
 
-<pre class="programlisting">
-typedef ... key_type;
+<pre class="programlisting">typedef ... key_type;
typedef Left data_type;

typedef signature-compatible with std::pair< ... ,const Left > value_type;
</pre>
<a name="unordered_set_of_complexity_signature"></a>
 
-<div class="section" lang="en">
+<div class="section" title="Complexity signature">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.complexity_signature"></a><a href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.complexity_signature" title="Complexity
- signature">Complexity
+<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.complexity_signature"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.complexity_signature" title="Complexity signature">Complexity
 signature</a>
</h5></div></div></div>

 Here and in the descriptions of operations of <code class="computeroutput">unordered_[multi]set_of</code>
- views, we adopt the scheme outlined in the <a href="bimap_reference.html#complexity_signature_explanation">complexity
+ views, we adopt the scheme outlined in the <a class="link" href="bimap_reference.html#complexity_signature_explanation">complexity
 signature section</a>. The complexity signature of <code class="computeroutput">unordered_[multi]set_of</code>
 view is:
 
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 copying: <code class="computeroutput">c(n) = n * log(n)</code>,
 </li>
-<li>
+<li class="listitem">
 insertion: average case <code class="computeroutput">i(n) = 1</code> (constant), worst case <code class="computeroutput">i(n) = n</code>,
 </li>
-<li>
+<li class="listitem">
 hinted insertion: average case <code class="computeroutput">h(n) = 1</code> (constant), worst case <code class="computeroutput">h(n) = n</code>,
 </li>
-<li>
+<li class="listitem">
 deletion: average case <code class="computeroutput">d(n) = 1</code> (constant), worst case <code class="computeroutput">d(n) = n</code>,
 </li>
-<li>
+<li class="listitem">
 replacement:
- <div class="itemizedlist"><ul type="circle">
-<li>
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
 if the new element key is equivalent to the original, <code class="computeroutput">r(n)
 = 1</code>
 (constant),
 </li>
-<li>
+<li class="listitem">
 otherwise, average case <code class="computeroutput">r(n) = 1</code> (constant), worst case <code class="computeroutput">r(n)
 = n</code>,
 </li>
</ul></div>
</li>
-<li>
+<li class="listitem">
 modifying: average case <code class="computeroutput">m(n) = 1</code> (constant), worst case <code class="computeroutput">m(n) = n</code>.
 </li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Instantiation types">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.instantiation_types"></a><a href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.instantiation_types" title="Instantiation
- types">Instantiation
+<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.instantiation_types"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.instantiation_types" title="Instantiation types">Instantiation
 types</a>
</h5></div></div></div>

@@ -450,18 +436,18 @@
 means of the collection type specifiers and the <code class="computeroutput">bimap</code>
 itself. Instantiations are dependent on the following types:
 
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
<code class="computeroutput">Value</code> from <code class="computeroutput">bimap</code>,
 </li>
-<li>
+<li class="listitem">
<code class="computeroutput">Allocator</code> from <code class="computeroutput">bimap</code>,
 </li>
-<li>
+<li class="listitem">
<code class="computeroutput">Hash</code> from the collection
 type specifier,
 </li>
-<li>
+<li class="listitem">
<code class="computeroutput">Pred</code> from the collection
 type specifier.
 </li>
@@ -476,14 +462,12 @@
 same value for keys equivalent under <code class="computeroutput">Pred</code>.
 
</div>
-<div class="section" lang="en">
+<div class="section" title="Nested types">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.nested_types"></a><a href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.nested_types" title="Nested
- types">Nested
+<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.nested_types"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.nested_types" title="Nested types">Nested
 types</a>
</h5></div></div></div>
-<pre class="programlisting">
-iterator
+<pre class="programlisting">iterator
const_iterator
local_iterator
const_local_iterator
@@ -499,10 +483,9 @@
 
</blockquote></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Constructors, copy and assignment">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.constructors__copy_and_assignment"></a><a href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.constructors__copy_and_assignment" title="Constructors,
- copy and assignment">Constructors,
+<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.constructors__copy_and_assignment"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.constructors__copy_and_assignment" title="Constructors, copy and assignment">Constructors,
 copy and assignment</a>
</h5></div></div></div>

@@ -511,47 +494,45 @@
 <code class="computeroutput">max_load_factor()</code>
 is 1.0.
 
-<pre class="programlisting">
-this_type & operator=(const this_type & x);
+<pre class="programlisting">this_type & operator=(const this_type & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: <code class="computeroutput">a
 = b</code>;
 where a and b are the <code class="computeroutput">bimap</code>
 objects to which <code class="computeroutput">*this</code>
 and x belong, respectively.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">*this.</code>
</li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Modifiers">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.modifiers"></a>Modifiers
+<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.modifiers"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.modifiers" title="Modifiers">Modifiers</a>
</h5></div></div></div>
<a name="reference_unordered_set_of_insert_value"></a>
 
-<pre class="programlisting">
-std::pair<iterator,bool> insert(const value_type & x);
+<pre class="programlisting">std::pair<iterator,bool> insert(const value_type & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: Inserts <code class="computeroutput">x</code>
 into the <code class="computeroutput">bimap</code> to which
 the view belongs if
- <div class="itemizedlist"><ul type="circle">
-<li>
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
 the view is non-unique OR no other element with equivalent key
 exists,
 </li>
-<li>
+<li class="listitem">
 AND insertion is allowed by all other views of the <code class="computeroutput">bimap</code>.
 </li>
</ul></div>
</li>
-<li>
+<li class="listitem">
Returns: The return value is a pair
 <code class="computeroutput">p</code>. <code class="computeroutput">p.second</code>
 is <code class="computeroutput">true</code> if and only if
@@ -560,60 +541,58 @@
 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.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
 O(I(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Strong.
 </li>
</ul></div>
<a name="reference_unordered_set_of_insert_iterator_value"></a>
 
-<pre class="programlisting">
-iterator insert(iterator position, const value_type & x);
+<pre class="programlisting">iterator insert(iterator position, const value_type & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view.
 </li>
-<li>
+<li class="listitem">
Effects: <code class="computeroutput">position</code>
 is used as a hint to improve the efficiency of the operation. Inserts
 <code class="computeroutput">x</code> into the <code class="computeroutput">bimap</code> to which the view belongs if
- <div class="itemizedlist"><ul type="circle">
-<li>
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
 the view is non-unique OR no other element with equivalent key
 exists,
 </li>
-<li>
+<li class="listitem">
 AND insertion is allowed by all other views of the <code class="computeroutput">bimap</code>.
 </li>
</ul></div>
</li>
-<li>
+<li class="listitem">
Returns: On successful insertion,
 an iterator to the newly inserted element. Otherwise, an iterator to
 an element that caused the insertion to be banned. Note that more than
 one element can be causing insertion not to be allowed.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
 O(H(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Strong.
 </li>
</ul></div>
<a name="reference_unordered_set_of_insert_iterator_iterator"></a>
 
-<pre class="programlisting">
-template< class InputIterator>
+<pre class="programlisting">template< class InputIterator>
void insert(InputIterator first, InputIterator last);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">InputIterator</code>
 is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html" target="_top">Input
 Iterator</a> over elements of type <code class="computeroutput">value_type</code>.
@@ -622,7 +601,7 @@
 this view belongs. <code class="computeroutput">last</code>
 is reachable from first.
 </li>
-<li>
+<li class="listitem">
Effects: <code class="computeroutput">iterator
 hint =
 end();</code><code class="computeroutput">while(first !=
@@ -630,129 +609,125 @@
 hint =
 insert(hint, *first++);</code>
</li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
 O(m*H(n+m)), where m is the number of elements in <code class="computeroutput">[first,
 last)</code>.
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic.
 </li>
</ul></div>
<a name="reference_unordered_set_of_erase_iterator"></a>
 
-<pre class="programlisting">
-iterator erase(iterator position);
+<pre class="programlisting">iterator erase(iterator position);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid dereferenceable <code class="computeroutput">iterator</code>
 of the view.
 </li>
-<li>
+<li class="listitem">
Effects: Deletes the element pointed
 to by <code class="computeroutput">position</code>.
 </li>
-<li>
+<li class="listitem">
Returns: An <code class="computeroutput">iterator</code>
 pointing to the element immediately following the one that was deleted,
 or <code class="computeroutput">end()</code>
 if no such element exists.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
 O(D(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: nothrow.
 </li>
</ul></div>
<a name="reference_unordered_set_of_erase_key"></a>
 
-<pre class="programlisting">
-template< class CompatibleKey >
+<pre class="programlisting">template< class CompatibleKey >
size_type erase(const CompatibleKey & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: Deletes the elements with
 key equivalent to <code class="computeroutput">x</code>.
 </li>
-<li>
+<li class="listitem">
Returns: Number of elements deleted.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
 Average case, O(1 + m*D(n)), worst case O(n + m*D(n)), where m is the
 number of elements deleted.
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic.
 </li>
</ul></div>
<a name="reference_unordered_set_of_erase_iterator_iterator"></a>
 
-<pre class="programlisting">
-iterator erase(iterator first, iterator last);
+<pre class="programlisting">iterator erase(iterator first, iterator last);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">[first,last)</code>
 is a valid range of the view.
 </li>
-<li>
+<li class="listitem">
Effects: Deletes the elements in
 <code class="computeroutput">[first,last)</code>.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">last</code>.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
 O(m*D(n)), where m is the number of elements in <code class="computeroutput">[first,last)</code>.
 </li>
-<li>
+<li class="listitem">
Exception safety: nothrow.
 </li>
</ul></div>
<a name="reference_unordered_set_of_replace_iterator_value"></a>
 
-<pre class="programlisting">
-bool replace(iterator position, const value_type & x);
+<pre class="programlisting">bool replace(iterator position, const value_type & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid dereferenceable <code class="computeroutput">iterator</code>
 of the view.
 </li>
-<li>
+<li class="listitem">
Effects: Assigns the value <code class="computeroutput">x</code> to the element pointed to by <code class="computeroutput">position</code> into the <code class="computeroutput">bimap</code>
- to which the view belongs if, for the value <code class="computeroutput">x</code><div class="itemizedlist"><ul type="circle">
-<li>
+ to which the view belongs if, for the value <code class="computeroutput">x</code><div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
 the view is non-unique OR no other element with equivalent key
 exists (except possibly <code class="computeroutput">*position</code>),
 </li>
-<li>
+<li class="listitem">
 AND replacing is allowed by all other views of the <code class="computeroutput">bimap</code>.
 </li>
</ul></div>
</li>
-<li>
+<li class="listitem">
Postconditions: Validity of position
 is preserved in all cases.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">true</code>
 if the replacement took place, <code class="computeroutput">false</code>
 otherwise.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
 O(R(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Strong. If an exception
 is thrown by some user-provided operation the <code class="computeroutput">bimap</code>
 to which the view belongs remains in its original state.
@@ -760,46 +735,45 @@
</ul></div>
<a name="reference_unordered_set_of_replace_key_iterator_key"></a>
 
-<pre class="programlisting">
-template< class CompatibleKey >
+<pre class="programlisting">template< class CompatibleKey >
bool replace_key(iterator position, const CompatibleKey & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid dereferenceable iterator of the set view. <code class="computeroutput">CompatibleKey</code> can be assigned to
 <code class="computeroutput">key_type</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Assigns the value <code class="computeroutput">x</code> to <code class="computeroutput">e.first</code>,
 where <code class="computeroutput">e</code> is the element
 pointed to by <code class="computeroutput">position</code>
 into the <code class="computeroutput">bimap</code> to which
 the set view belongs if,
- <div class="itemizedlist"><ul type="circle">
-<li>
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
 the map view is non-unique OR no other element with equivalent
 key exists (except possibly <code class="computeroutput">*position</code>),
 </li>
-<li>
+<li class="listitem">
 AND replacing is allowed by all other views of the <code class="computeroutput">bimap</code>.
 </li>
</ul></div>
</li>
-<li>
+<li class="listitem">
Postconditions: Validity of position
 is preserved in all cases.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">true</code>
 if the replacement took place, <code class="computeroutput">false</code>
 otherwise.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
 O(R(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Strong. If an exception
 is thrown by some user-provided operation, the <code class="computeroutput">bimap</code>
 to which the set view belongs remains in its original state.
@@ -807,46 +781,45 @@
</ul></div>
<a name="reference_unordered_set_of_replace_data_iterator_data"></a>
 
-<pre class="programlisting">
-template< class CompatibleData >
+<pre class="programlisting">template< class CompatibleData >
bool replace_data(iterator position, const CompatibleData & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid dereferenceable iterator of the set view. <code class="computeroutput">CompatibleKey</code> can be assigned to
 <code class="computeroutput">data_type</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Assigns the value <code class="computeroutput">x</code> to <code class="computeroutput">e.second</code>,
 where <code class="computeroutput">e</code> is the element
 pointed to by <code class="computeroutput">position</code>
 into the <code class="computeroutput">bimap</code> to which
 the set view belongs if,
- <div class="itemizedlist"><ul type="circle">
-<li>
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
 the map view is non-unique OR no other element with equivalent
 key exists (except possibly <code class="computeroutput">*position</code>),
 </li>
-<li>
+<li class="listitem">
 AND replacing is allowed by all other views of the <code class="computeroutput">bimap</code>.
 </li>
</ul></div>
</li>
-<li>
+<li class="listitem">
Postconditions: Validity of position
 is preserved in all cases.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">true</code>
 if the replacement took place, <code class="computeroutput">false</code>
 otherwise.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
 O(R(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Strong. If an exception
 is thrown by some user-provided operation, the <code class="computeroutput">bimap</code>
 to which the set view belongs remains in its original state.
@@ -854,108 +827,106 @@
</ul></div>
<a name="reference_unordered_set_of_modify_key_iterator_modifier"></a>
 
-<pre class="programlisting">
-template< class KeyModifier >
+<pre class="programlisting">template< class KeyModifier >
bool modify_key(iterator position, KeyModifier mod);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">KeyModifier</code>
 is a model of <a href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">Unary
 Function</a> accepting arguments of type: <code class="computeroutput">key_type&</code>; <code class="computeroutput">position</code>
 is a valid dereferenceable iterator of the view.
 </li>
-<li>
+<li class="listitem">
Effects: Calls <code class="computeroutput">mod(e.first)</code> where e is the element pointed to
 by position and rearranges <code class="computeroutput">*position</code> into all the views of the
 <code class="computeroutput">bimap</code>. If the rearrangement
 fails, the element is erased. Rearrangement is successful if
- <div class="itemizedlist"><ul type="circle">
-<li>
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
 the map view is non-unique OR no other element with equivalent
 key exists,
 </li>
-<li>
+<li class="listitem">
 AND rearrangement is allowed by all other views of the <code class="computeroutput">bimap</code>.
 </li>
</ul></div>
</li>
-<li>
+<li class="listitem">
Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
 succeeds.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">true</code>
 if the operation succeeded, <code class="computeroutput">false</code>
 otherwise.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
 O(M(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic. If an exception
 is thrown by some user-provided operation (except possibly mod), then
 the element pointed to by position is erased.
 </li>
-<li>
+<li class="listitem">
Note: Only provided for map views.
 </li>
</ul></div>
<a name="reference_unordered_set_of_modify_data_iterator_modifier"></a>
 
-<pre class="programlisting">
-template< class DataModifier >
+<pre class="programlisting">template< class DataModifier >
bool modify_data(iterator position, DataModifier mod);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">DataModifier</code>
 is a model of <a href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">Unary
 Function</a> accepting arguments of type: <code class="computeroutput">data_type&</code>; <code class="computeroutput">position</code>
 is a valid dereferenceable iterator of the view.
 </li>
-<li>
+<li class="listitem">
Effects: Calls <code class="computeroutput">mod(e.second)</code> where e is the element pointed to
 by position and rearranges <code class="computeroutput">*position</code> into all the views of the
 <code class="computeroutput">bimap</code>. If the rearrangement
 fails, the element is erased. Rearrangement is successful if
- <div class="itemizedlist"><ul type="circle">
-<li>
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
 the oppositte map view is non-unique OR no other element with equivalent
 key in that view exists,
 </li>
-<li>
+<li class="listitem">
 AND rearrangement is allowed by all other views of the <code class="computeroutput">bimap</code>.
 </li>
</ul></div>
</li>
-<li>
+<li class="listitem">
Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
 succeeds.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">true</code>
 if the operation succeeded, <code class="computeroutput">false</code>
 otherwise.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
 O(M(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic. If an exception
 is thrown by some user-provided operation (except possibly mod), then
 the element pointed to by position is erased.
 </li>
-<li>
+<li class="listitem">
Note: Only provided for map views.
 </li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Lookup">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.lookup"></a>Lookup
+<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.lookup"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.lookup" title="Lookup">Lookup</a>
</h5></div></div></div>

 <code class="computeroutput">unordered_[multi]set_of</code> views provide the full lookup
@@ -981,45 +952,42 @@
 
<a name="reference_unordered_set_of_find_key"></a>
 
-<pre class="programlisting">
-template< class CompatibleKey >
+<pre class="programlisting">template< class CompatibleKey >
iterator find(const CompatibleKey & x);

template< class CompatibleKey >
const_iterator find(const CompatibleKey & x) const;
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: Returns a pointer to an element
 whose key is equivalent to <code class="computeroutput">x</code>,
 or <code class="computeroutput">end()</code>
 if such an element does not exist.
 </li>
-<li>
+<li class="listitem">
Complexity: Average case O(1) (constant),
 worst case O(n).
 </li>
</ul></div>
<a name="reference_unordered_set_of_count_key"></a>
 
-<pre class="programlisting">
-template< class CompatibleKey >
+<pre class="programlisting">template< class CompatibleKey >
size_type count(const CompatibleKey & x) const;
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: Returns the number of elements
 with key equivalent to <code class="computeroutput">x</code>.
 </li>
-<li>
+<li class="listitem">
Complexity: Average case O(count(x)),
 worst case O(n).
 </li>
</ul></div>
<a name="reference_unordered_set_of_equal_range_key"></a>
 
-<pre class="programlisting">
-template< class CompatibleKey >
+<pre class="programlisting">template< class CompatibleKey >
std::pair<iterator,iterator>
 equal_range(const CompatibleKey & x);

@@ -1027,46 +995,44 @@
std::pair<const_iterator,const_iterator>
 equal_range(const CompatibleKey & x) const;
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: Returns a range containing
 all elements with keys equivalent to <code class="computeroutput">x</code>
 (and only those).
 </li>
-<li>
+<li class="listitem">
Complexity: Average case O(count(x)),
 worst case O(n).
 </li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="at(), info_at() and operator[] - set_of only">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.at____info_at___and_operator_______set_of_only"></a><a href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.at____info_at___and_operator_______set_of_only" title="at(),
- info_at() and operator[] - set_of only">at(),
+<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.at____info_at___and_operator_______set_of_only"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.at____info_at___and_operator_______set_of_only" title="at(), info_at() and operator[] - set_of only">at(),
 info_at() and operator[] - set_of only</a>
</h5></div></div></div>
<a name="reference_unordered_set_of_at_key_const"></a>
 
-<pre class="programlisting">
-template< class CompatibleKey >
+<pre class="programlisting">template< class CompatibleKey >
const data_type & at(const CompatibleKey & k) const;
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">CompatibleKey</code>
 is a compatible key of <code class="computeroutput">key_compare</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Returns the <code class="computeroutput">data_type</code> reference that is associated
 with <code class="computeroutput">k</code>, or throws
 <code class="computeroutput">std::out_of_range</code> if such key does not
 exist.
 </li>
-<li>
+<li class="listitem">
Complexity: Average case O(1) (constant),
 worst case O(n).
 </li>
-<li>
+<li class="listitem">
Note: Only provided when <code class="computeroutput">unordered_set_of</code> is used.
 </li>
</ul></div>
@@ -1078,116 +1044,111 @@
 
<a name="reference_unordered_set_of_operator_bracket_key"></a>
 
-<pre class="programlisting">
-template< class CompatibleKey >
+<pre class="programlisting">template< class CompatibleKey >
data_type & operator[](const CompatibleKey & k);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">CompatibleKey</code>
 is a compatible key of <code class="computeroutput">key_compare</code>.
 </li>
-<li>
+<li class="listitem">
Effects: <code class="computeroutput">return
 insert(value_type(k,data_type()))->second;</code>
</li>
-<li>
+<li class="listitem">
Complexity: If the insertion is performed
 O(I(n)), else: Average case O(1) (constant), worst case O(n).
 </li>
-<li>
+<li class="listitem">
Note: Only provided when <code class="computeroutput">unordered_set_of</code> is used and the
 other collection type is mutable.
 </li>
</ul></div>
<a name="reference_unordered_set_of_at_key"></a>
 
-<pre class="programlisting">
-template< class CompatibleKey >
+<pre class="programlisting">template< class CompatibleKey >
data_type & at(const CompatibleKey & k);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">CompatibleKey</code>
 is a compatible key of <code class="computeroutput">key_compare</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Returns the <code class="computeroutput">data_type</code> reference that is associated
 with <code class="computeroutput">k</code>, or throws
 <code class="computeroutput">std::out_of_range</code> if such key does not
 exist.
 </li>
-<li>
+<li class="listitem">
Complexity: Average case O(1) (constant),
 worst case O(n).
 </li>
-<li>
+<li class="listitem">
Note: Only provided when <code class="computeroutput">unordered_set_of</code> is used and the
 other collection type is mutable.
 </li>
</ul></div>
<a name="reference_unordered_set_of_info_at_key"></a>
 
-<pre class="programlisting">
-template< class CompatibleKey >
+<pre class="programlisting">template< class CompatibleKey >
info_type & info_at(const CompatibleKey & k);

template< class CompatibleKey >
const info_type & info_at(const CompatibleKey & k) const;
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">CompatibleKey</code>
 is a compatible key of <code class="computeroutput">key_compare</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Returns the <code class="computeroutput">info_type</code> reference that is associated
 with <code class="computeroutput">k</code>, or throws
 <code class="computeroutput">std::out_of_range</code> if such key does not
 exist.
 </li>
-<li>
+<li class="listitem">
Complexity: Average case O(1) (constant),
 worst case O(n).
 </li>
-<li>
+<li class="listitem">
Note: Only provided when <code class="computeroutput">unordered_set_of</code> and <code class="computeroutput">info_hook</code> are used
 </li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Hash policy">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.hash_policy"></a><a href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.hash_policy" title="Hash
- policy">Hash
+<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.hash_policy"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.hash_policy" title="Hash policy">Hash
 policy</a>
</h5></div></div></div>
<a name="reference_unordered_set_of_rehash_size"></a>
 
-<pre class="programlisting">
-void rehash(size_type n);
+<pre class="programlisting">void rehash(size_type n);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: Increases if necessary the
 number of internal buckets so that <code class="computeroutput">size()/bucket_count()</code> does not exceed the maximum load
 factor, and <code class="computeroutput">bucket_count()>=n</code>.
 </li>
-<li>
+<li class="listitem">
Postconditions: Validity of iterators
 and references to the elements contained is preserved.
 </li>
-<li>
+<li class="listitem">
Complexity: Average case O(size()),
 worst case O(size(n)2).
 </li>
-<li>
+<li class="listitem">
Exception safety: Strong.
 </li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Serialization">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.serialization"></a>Serialization
+<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.serialization"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.serialization" title="Serialization">Serialization</a>
</h5></div></div></div>

 Views cannot be serialized on their own, but only as part of the <code class="computeroutput">bimap</code> into which they are embedded.
@@ -1195,78 +1156,96 @@
 to <code class="computeroutput">unordered_[multi]set_of</code> views with respect to serialization
 of their embedding containers, we use the concepts defined in the <code class="computeroutput">bimap</code> serialization section.
 
-<div class="sidebar">
+<div class="sidebar">
+
+
 Operation: saving of a <code class="computeroutput">bimap</code> b to an output archive (XML archive)
 ar.
- </div>
-<div class="itemizedlist"><ul type="disc"><li>
+ 
+</div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
Requires: No additional requirements
 to those imposed by the container.
 </li></ul></div>
-<div class="sidebar">
+<div class="sidebar">
+
+
 Operation: loading of a <code class="computeroutput">bimap</code> b' from an input archive (XML
 archive) ar.
- </div>
-<div class="itemizedlist"><ul type="disc">
-<li>
+ 
+</div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: Additionally to the general
 requirements, <code class="computeroutput">key_eq()</code> must be serialization-compatible
 with <code class="computeroutput">m.get<i>().key_eq()</code>,
 where i is the position of the <code class="computeroutput">unordered_[multi]set_of</code>
 view in the container.
 </li>
-<li>
+<li class="listitem">
Postconditions: On successful loading,
 the range <code class="computeroutput">[begin(), end())</code> contains restored copies of every
 element in <code class="computeroutput">[m.get<i>().begin(), m.get<i>().end())</code>, though not necessarily in the same
 order.
 </li>
</ul></div>
-<div class="sidebar">
+<div class="sidebar">
+
+
 Operation: saving of an <code class="computeroutput">iterator</code> or <code class="computeroutput">const_iterator</code>
 <code class="computeroutput">it</code> to an output archive
 (XML archive) ar.
- </div>
-<div class="itemizedlist"><ul type="disc"><li>
+ 
+</div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
Requires: <code class="computeroutput">it</code>
 is a valid <code class="computeroutput">iterator</code>
 of the view. The associated <code class="computeroutput">bimap</code>
 has been previously saved.
 </li></ul></div>
-<div class="sidebar">
+<div class="sidebar">
+
+
 Operation: loading of an iterator or
 <code class="computeroutput">const_iterator it</code>'
 from an input archive (XML archive) ar.
- </div>
-<div class="itemizedlist"><ul type="disc">
-<li>
+ 
+</div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Postconditions: On successful loading,
 if <code class="computeroutput">it</code> was dereferenceable
 then <code class="computeroutput">*it</code>'
 is the restored copy of <code class="computeroutput">*it</code>, otherwise <code class="computeroutput">it</code>'<code class="computeroutput">
 == end()</code>.
 </li>
-<li>
+<li class="listitem">
Note: It is allowed that <code class="computeroutput">it</code> be a <code class="computeroutput">const_iterator</code>
 and the restored <code class="computeroutput">it</code>'
 an <code class="computeroutput">iterator</code>, or viceversa.
 </li>
</ul></div>
-<div class="sidebar">
+<div class="sidebar">
+
+
 Operation: saving of a local_iterator
 or const_local_iterator it to an output archive (XML archive) ar.
- </div>
-<div class="itemizedlist"><ul type="disc"><li>
+ 
+</div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
Requires: <code class="computeroutput">it</code>
 is a valid local iterator of the view. The associated <code class="computeroutput">bimap</code> has been previously saved.
 </li></ul></div>
-<div class="sidebar">
+<div class="sidebar">
+
+
 Operation: loading of a <code class="computeroutput">local_iterator</code> or <code class="computeroutput">const_local_iterator</code>
 <code class="computeroutput">it</code>' from an input archive
 (XML archive) ar.
- </div>
-<div class="itemizedlist"><ul type="disc">
-<li>
+ 
+</div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Postconditions: On successful loading,
 if <code class="computeroutput">it</code> was dereferenceable
 then <code class="computeroutput">*it</code>'
@@ -1279,7 +1258,7 @@
 and <code class="computeroutput">i</code> is the ordinal
 of the index.)
 </li>
-<li>
+<li class="listitem">
Note: It is allowed that <code class="computeroutput">it</code> be a <code class="computeroutput">const_local_iterator</code>
 and the restored <code class="computeroutput">it</code>'
 a <code class="computeroutput">local_iterator</code>, or

Modified: trunk/libs/bimap/doc/html/boost_bimap/reference/vector_of_reference.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/reference/vector_of_reference.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/reference/vector_of_reference.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -1,33 +1,30 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>vector_of
- Reference</title>
+<title>vector_of Reference</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../reference.html" title="Reference">
<link rel="prev" href="list_of_reference.html" title="list_of Reference">
-<link rel="next" href="unconstrained_set_of_reference.html" title="unconstrained_set_of
- Reference">
+<link rel="next" href="unconstrained_set_of_reference.html" title="unconstrained_set_of Reference">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="list_of_reference.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="unconstrained_set_of_reference.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="vector_of Reference">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.reference.vector_of_reference"></a><a href="vector_of_reference.html" title="vector_of
- Reference">vector_of
+<a name="boost_bimap.reference.vector_of_reference"></a><a class="link" href="vector_of_reference.html" title="vector_of Reference">vector_of
 Reference</a>
</h3></div></div></div>
<div class="toc"><dl>
@@ -52,14 +49,12 @@
<dt>Serialization</dt>
</dl></dd>
</dl></div>
-<div class="section" lang="en">
+<div class="section" title='Header "boost/bimap/vector_of.hpp" synopsis'>
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.reference.vector_of_reference.header__boost_bimap_vector_of_hpp__synopsis"></a><a href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.header__boost_bimap_vector_of_hpp__synopsis" title='Header
- "boost/bimap/vector_of.hpp" synopsis'>Header
+<a name="boost_bimap.reference.vector_of_reference.header__boost_bimap_vector_of_hpp__synopsis"></a><a class="link" href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.header__boost_bimap_vector_of_hpp__synopsis" title='Header "boost/bimap/vector_of.hpp" synopsis'>Header
 "boost/bimap/vector_of.hpp" synopsis</a>
</h4></div></div></div>
-<pre class="programlisting">
-namespace boost {
+<pre class="programlisting">namespace boost {
namespace bimaps {

@@ -73,10 +68,9 @@
} // namespace boost
</pre>
</div>
-<div class="section" lang="en">
+<div class="section" title="vector_of views">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.reference.vector_of_reference.vector_of_views"></a><a href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views" title="vector_of
- views">vector_of
+<a name="boost_bimap.reference.vector_of_reference.vector_of_views"></a><a class="link" href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views" title="vector_of views">vector_of
 views</a>
</h4></div></div></div>
<div class="toc"><dl>
@@ -113,17 +107,17 @@
 As is the case with list_of views, vector_of views have the following limitations
 with respect to STL sequence containers:
 
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 vector_of views are not Assignable
 (like any other view.)
 </li>
-<li>
+<li class="listitem">
 Insertions into a vector_of view may fail due to clashings with other
 views. This alters the semantics of the operations provided with respect
 to their analogues in STL sequence containers.
 </li>
-<li>
+<li class="listitem">
 Elements in a vector_of view are not mutable, and can only be changed
 by means of replace and modify member functions.
 </li>
@@ -139,8 +133,7 @@
 either not present in the concepts modeled or do not exactly conform to
 the requirements for these types of containers.
 
-<pre class="programlisting">
-namespace boost {
+<pre class="programlisting">namespace boost {
namespace bimaps {
namespace views {

@@ -171,9 +164,9 @@
 this_type & operator=(this_type & x);

 template< class InputIterator >
- void assign(InputIterator first, InputIterator last);
+ void <a class="link" href="vector_of_reference.html#reference_vector_of_assign_iterator_iterator">assign</a>(InputIterator first, InputIterator last);

- void assign(size_type n, const value_type & value);
+ void <a class="link" href="vector_of_reference.html#reference_vector_of_assign_size_value">assign</a>(size_type n, const value_type & value);

 allocator_type get_allocator() const;

@@ -199,11 +192,11 @@

 size_type max_size() const;

- size_type capacity() const;
+ size_type <a class="link" href="vector_of_reference.html#reference_vector_of_capacity">capacity</a>() const;

- void reserve(size_type m);
+ void <a class="link" href="vector_of_reference.html#reference_vector_of_reserve_size">reserve</a>(size_type m);

- void resize(size_type n, const value_type & x = value_type());
+ void <a class="link" href="vector_of_reference.html#reference_vector_of_resize_size_value">resize</a>(size_type n, const value_type & x = value_type());

 // access

@@ -217,38 +210,38 @@

 // modifiers

- std::pair<iterator,bool> push_front(const value_type & x);
+ std::pair<iterator,bool> <a class="link" href="vector_of_reference.html#reference_vector_of_push_front_value">push_front</a>(const value_type & x);
 void pop_front();

- std::pair<iterator,bool> push_back(const value_type & x);
+ std::pair<iterator,bool> <a class="link" href="vector_of_reference.html#reference_vector_of_push_back_value">push_back</a>(const value_type & x);
 void pop_back();

- std::pair<iterator,bool> insert(iterator position, const value_type & x);
+ std::pair<iterator,bool> <a class="link" href="vector_of_reference.html#reference_vector_of_insert_iterator_value">insert</a>(iterator position, const value_type & x);

- void insert(iterator position, size_type m, const value_type & x);
+ void <a class="link" href="vector_of_reference.html#reference_vector_of_insert_iterator_size_value">insert</a>(iterator position, size_type m, const value_type & x);

 template< class InputIterator>
- void insert(iterator position, InputIterator first, InputIterator last);
+ void <a class="link" href="vector_of_reference.html#reference_vector_of_insert_iterator_iterator_iterator">insert</a>(iterator position, InputIterator first, InputIterator last);

- iterator erase(iterator position);
- iterator erase(iterator first, iterator last);
+ iterator <a class="link" href="vector_of_reference.html#reference_vector_of_erase_iterator">erase</a>(iterator position);
+ iterator <a class="link" href="vector_of_reference.html#reference_vector_of_erase_iterator_iterator">erase</a>(iterator first, iterator last);

- bool replace(iterator position, const value_type & x);
+ bool <a class="link" href="vector_of_reference.html#reference_vector_of_replace_iterator_value">replace</a>(iterator position, const value_type & x);

 // Only in map views
 // {

 template< class CompatibleKey >
- bool replace_key(iterator position, const CompatibleKey & x);
+ bool <a class="link" href="vector_of_reference.html#reference_vector_of_replace_key_iterator_key">replace_key</a>(iterator position, const CompatibleKey & x);

 template< class CompatibleData >
- bool replace_data(iterator position, const CompatibleData & x);
+ bool <a class="link" href="vector_of_reference.html#reference_vector_of_replace_data_iterator_data">replace_data</a>(iterator position, const CompatibleData & x);

 template< class KeyModifier >
- bool modify_key(iterator position, KeyModifier mod);
+ bool <a class="link" href="vector_of_reference.html#reference_vector_of_modify_key_iterator_modifier">modify_key</a>(iterator position, KeyModifier mod);

 template< class DataModifier >
- bool modify_data(iterator position, DataModifier mod);
+ bool <a class="link" href="vector_of_reference.html#reference_vector_of_modify_data_iterator_modifier">modify_data</a>(iterator position, DataModifier mod);

 // }

@@ -257,37 +250,37 @@

 // list operations

- void splice(iterator position, this_type & x);
- void splice(iterator position, this_type & x, iterator i);
- void splice(
+ void <a class="link" href="vector_of_reference.html#reference_vector_of_splice_iterator_this">splice</a>(iterator position, this_type & x);
+ void <a class="link" href="vector_of_reference.html#reference_vector_of_splice_iterator_this_iterator">splice</a>(iterator position, this_type & x, iterator i);
+ void <a class="link" href="vector_of_reference.html#reference_vector_of_splice_iterator_this_iterator_iterator">splice</a>(
 iterator position, this_type & x, iterator first, iterator last);

- void remove(const value_type & value);
+ void <a class="link" href="vector_of_reference.html#reference_vector_of_remove_value">remove</a>(const value_type & value);

 template< class Predicate >
- void remove_if(Predicate pred);
+ void <a class="link" href="vector_of_reference.html#reference_vector_of_remove_if_predicate">remove_if</a>(Predicate pred);

- void unique();
+ void <a class="link" href="vector_of_reference.html#reference_vector_of_unique">unique</a>();

 template< class BinaryPredicate >
- void unique(BinaryPredicate binary_pred);
+ void <a class="link" href="vector_of_reference.html#reference_vector_of_unique_predicate">unique</a>(BinaryPredicate binary_pred);

- void merge(this_type & x);
+ void <a class="link" href="vector_of_reference.html#reference_vector_of_merge_this">merge</a>(this_type & x);

 template< typename Compare >
- void merge(this_type & x, Compare comp);
+ void <a class="link" href="vector_of_reference.html#reference_vector_of_merge_this_compare">merge</a>(this_type & x, Compare comp);

- void sort();
+ void <a class="link" href="vector_of_reference.html#reference_vector_of_sort">sort</a>();

 template< typename Compare >
- void sort(Compare comp);
+ void <a class="link" href="vector_of_reference.html#reference_vector_of_sort_compare">sort</a>(Compare comp);

- void reverse();
+ void <a class="link" href="vector_of_reference.html#reference_vector_of_reverse">reverse</a>();

 // rearrange operations

- void relocate(iterator position, iterator i);
- void relocate(iterator position, iterator first, iterator last);
+ void <a class="link" href="vector_of_reference.html#reference_vector_of_relocate_iterator_iterator">relocate</a>(iterator position, iterator i);
+ void <a class="link" href="vector_of_reference.html#reference_vector_of_relocate_iterator_iterator_iterator">relocate</a>(iterator position, iterator first, iterator last);
};

// view comparison
@@ -309,15 +302,13 @@

 In the set view:
 
-<pre class="programlisting">
-typedef signature-compatible with relation< Left, ... > key_type;
+<pre class="programlisting">typedef signature-compatible with relation< Left, ... > key_type;
typedef signature-compatible with relation< Left, ... > value_type;
</pre>

 In the left map view:
 
-<pre class="programlisting">
-typedef Left key_type;
+<pre class="programlisting">typedef Left key_type;
typedef ... data_type;

typedef signature-compatible with std::pair< Left, ... > value_type;
@@ -325,46 +316,44 @@

 In the right map view:
 
-<pre class="programlisting">
-typedef ... key_type;
+<pre class="programlisting">typedef ... key_type;
typedef Left data_type;

typedef signature-compatible with std::pair< ... , Left > value_type;
</pre>
<a name="vector_of_complexity_signature"></a>
 
-<div class="section" lang="en">
+<div class="section" title="Complexity signature">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.vector_of_reference.vector_of_views.complexity_signature"></a><a href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.complexity_signature" title="Complexity
- signature">Complexity
+<a name="boost_bimap.reference.vector_of_reference.vector_of_views.complexity_signature"></a><a class="link" href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.complexity_signature" title="Complexity signature">Complexity
 signature</a>
</h5></div></div></div>

 Here and in the descriptions of operations of <code class="computeroutput">vector_of</code>
- views, we adopt the scheme outlined in the <a href="bimap_reference.html#complexity_signature_explanation">complexity
+ views, we adopt the scheme outlined in the <a class="link" href="bimap_reference.html#complexity_signature_explanation">complexity
 signature section</a>. The complexity signature of <code class="computeroutput">vector_of</code>
 view is:
 
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 copying: <code class="computeroutput">c(n) = n * log(n)</code>,
 </li>
-<li>
+<li class="listitem">
 insertion: <code class="computeroutput">i(n) = 1</code> (amortized
 constant),
 </li>
-<li>
+<li class="listitem">
 hinted insertion: <code class="computeroutput">h(n) = 1</code> (amortized constant),
 </li>
-<li>
+<li class="listitem">
 deletion: <code class="computeroutput">d(n) = m</code>,
 where m is the distance from the deleted element to the end of the
 sequence,
 </li>
-<li>
+<li class="listitem">
 replacement: <code class="computeroutput">r(n) = 1</code> (constant),
 </li>
-<li>
+<li class="listitem">
 modifying: <code class="computeroutput">m(n) = 1</code> (constant).
 </li>
</ul></div>
@@ -372,21 +361,23 @@
 The following expressions are also used as a convenience for writing
 down some of the complexity formulas:
 
-<div class="sidebar">
+<div class="sidebar">
+
+
 <code class="computeroutput">shl(a,b) = a+b</code>
 if a is nonzero, 0 otherwise. <code class="computeroutput">rel(a,b,c) =</code> if
 <code class="computeroutput">a<b</code>, <code class="computeroutput">c-a</code>,
 else <code class="computeroutput">a-b</code>,
- </div>
+ 
+</div>

 (<code class="computeroutput">shl</code> and <code class="computeroutput">rel</code> stand for shift left
 and relocate, respectively.)
 
</div>
-<div class="section" lang="en">
+<div class="section" title="Instantiation types">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.vector_of_reference.vector_of_views.instantiation_types"></a><a href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.instantiation_types" title="Instantiation
- types">Instantiation
+<a name="boost_bimap.reference.vector_of_reference.vector_of_views.instantiation_types"></a><a class="link" href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.instantiation_types" title="Instantiation types">Instantiation
 types</a>
</h5></div></div></div>

@@ -395,45 +386,42 @@
 specified by means of the collection type specifiers and the bimap itself.
 Instantiations are dependent on the following types:
 
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
<code class="computeroutput">Value</code> from <code class="computeroutput">vector_of</code>,
 </li>
-<li>
+<li class="listitem">
<code class="computeroutput">Allocator</code> from <code class="computeroutput">bimap</code>,
 </li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Constructors, copy and assignment">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.vector_of_reference.vector_of_views.constructors__copy_and_assignment"></a><a href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.constructors__copy_and_assignment" title="Constructors,
- copy and assignment">Constructors,
+<a name="boost_bimap.reference.vector_of_reference.vector_of_views.constructors__copy_and_assignment"></a><a class="link" href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.constructors__copy_and_assignment" title="Constructors, copy and assignment">Constructors,
 copy and assignment</a>
</h5></div></div></div>

 As explained in the views concepts section, views do not have public
 constructors or destructors. Assignment, on the other hand, is provided.
 
-<pre class="programlisting">
-this_type & operator=(const this_type & x);
+<pre class="programlisting">this_type & operator=(const this_type & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: <code class="computeroutput">a=b;</code> where a and b are the <code class="computeroutput">bimap</code> objects to which <code class="computeroutput">*this</code>
 and <code class="computeroutput">x</code> belong, respectively.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">*this</code>.
 </li>
</ul></div>
<a name="reference_vector_of_assign_iterator_iterator"></a>
 
-<pre class="programlisting">
-template< class InputIterator >
+<pre class="programlisting">template< class InputIterator >
void assign(InputIterator first, InputIterator last);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">InputIterator</code>
 is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html" target="_top">Input
 Iterator</a> over elements of type <code class="computeroutput">value_type</code>
@@ -443,16 +431,15 @@
 this view belongs. <code class="computeroutput">last</code>
 is reachable from <code class="computeroutput">first</code>.
 </li>
-<li>
+<li class="listitem">
Effects: <code class="computeroutput">clear(); insert(end(),first,last);</code>
</li>
</ul></div>
<a name="reference_vector_of_assign_size_value"></a>
 
-<pre class="programlisting">
-void assign(size_type n, const value_type & value);
+<pre class="programlisting">void assign(size_type n, const value_type & value);
</pre>
-<div class="itemizedlist"><ul type="disc"><li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
Effects: <code class="computeroutput">clear(); for(size_type
 i =
 0;
@@ -461,19 +448,17 @@
 ++n) push_back(v);</code>
</li></ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Capacity operations">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.vector_of_reference.vector_of_views.capacity_operations"></a><a href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.capacity_operations" title="Capacity
- operations">Capacity
+<a name="boost_bimap.reference.vector_of_reference.vector_of_views.capacity_operations"></a><a class="link" href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.capacity_operations" title="Capacity operations">Capacity
 operations</a>
</h5></div></div></div>
<a name="reference_vector_of_capacity"></a>
 
-<pre class="programlisting">
-size_type capacity() const;
+<pre class="programlisting">size_type capacity() const;
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Returns: The total number of elements
 <code class="computeroutput">c</code> such that, when
 <code class="computeroutput">size()
@@ -481,7 +466,7 @@
 back insertions happen in constant time (the general case as described
 by i(n) is amortized constant time.)
 </li>
-<li>
+<li class="listitem">
Note: Validity of iterators and references
 to elements is preserved in all insertions, regardless of the capacity
 status.
@@ -489,60 +474,57 @@
</ul></div>
<a name="reference_vector_of_reserve_size"></a>
 
-<pre class="programlisting">
-void reserve(size_type m);
+<pre class="programlisting">void reserve(size_type m);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: If the previous value of
 <code class="computeroutput">capacity()</code>
 was greater than or equal to <code class="computeroutput">m</code>,
 nothing is done; otherwise, the internal capacity is changed so that
 <code class="computeroutput">capacity()>=m</code>.
 </li>
-<li>
+<li class="listitem">
Complexity: If the capacity is not
 changed, constant; otherwise O(n).
 </li>
-<li>
+<li class="listitem">
Exception safety: If the capacity
 is not changed, nothrow; otherwise, strong.
 </li>
</ul></div>
<a name="reference_vector_of_resize_size_value"></a>
 
-<pre class="programlisting">
-void resize(size_type n, const value_type & x = value_type());
+<pre class="programlisting">void resize(size_type n, const value_type & x = value_type());
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: <code class="computeroutput">if( n > size() ) insert(end(),
 n-size(),
 x);</code><code class="computeroutput">else if( n<size() ) erase(begin()+n,end());</code>
</li>
-<li>
+<li class="listitem">
Note: If an expansion is requested,
 the size of the view is not guaranteed to be n after this operation
 (other views may ban insertions.)
 </li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Modifiers">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.vector_of_reference.vector_of_views.modifiers"></a>Modifiers
+<a name="boost_bimap.reference.vector_of_reference.vector_of_views.modifiers"></a><a class="link" href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.modifiers" title="Modifiers">Modifiers</a>
</h5></div></div></div>
<a name="reference_vector_of_push_front_value"></a>
 
-<pre class="programlisting">
-std::pair<iterator,bool> push_front(const value_type & x);
+<pre class="programlisting">std::pair<iterator,bool> push_front(const value_type & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: Inserts x at the beginning
 of the sequence if no other view of the <code class="computeroutput">bimap</code>
 bans the insertion.
 </li>
-<li>
+<li class="listitem">
Returns: The return value is a pair
 <code class="computeroutput">p</code>. <code class="computeroutput">p.second</code>
 is <code class="computeroutput">true</code> if and only if
@@ -551,26 +533,25 @@
 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.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
 O(n+I(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Strong.
 </li>
</ul></div>
<a name="reference_vector_of_push_back_value"></a>
 
-<pre class="programlisting">
-std::pair<iterator,bool> push_back(const value_type & x);
+<pre class="programlisting">std::pair<iterator,bool> push_back(const value_type & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: Inserts <code class="computeroutput">x</code>
 at the end of the sequence if no other view of the <code class="computeroutput">bimap</code>
 bans the insertion.
 </li>
-<li>
+<li class="listitem">
Returns: The return value is a pair
 <code class="computeroutput">p</code>. <code class="computeroutput">p.second</code>
 is <code class="computeroutput">true</code> if and only if
@@ -579,30 +560,29 @@
 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.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
 O(I(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Strong.
 </li>
</ul></div>
<a name="reference_vector_of_insert_iterator_value"></a>
 
-<pre class="programlisting">
-std::pair<iterator,bool> insert(iterator position, const value_type & x);
+<pre class="programlisting">std::pair<iterator,bool> insert(iterator position, const value_type & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view.
 </li>
-<li>
+<li class="listitem">
Effects: Inserts <code class="computeroutput">x</code>
 before position if insertion is allowed by all other views of the
 <code class="computeroutput">bimap</code>.
 </li>
-<li>
+<li class="listitem">
Returns: The return value is a pair
 <code class="computeroutput">p</code>. <code class="computeroutput">p.second</code>
 is <code class="computeroutput">true</code> if and only if
@@ -611,25 +591,24 @@
 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.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
 O(shl(end()-position,1) + I(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Strong.
 </li>
</ul></div>
<a name="reference_vector_of_insert_iterator_size_value"></a>
 
-<pre class="programlisting">
-void insert(iterator position, size_type m, const value_type & x);
+<pre class="programlisting">void insert(iterator position, size_type m, const value_type & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view.
 </li>
-<li>
+<li class="listitem">
Effects: <code class="computeroutput">for(size_type
 i =
 0;
@@ -637,19 +616,18 @@
 m;
 ++i) insert(position, x);</code>
</li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
 O(shl(end()-position,m) + m*I(n+m)).
 </li>
</ul></div>
<a name="reference_vector_of_insert_iterator_iterator_iterator"></a>
 
-<pre class="programlisting">
-template< class InputIterator >
+<pre class="programlisting">template< class InputIterator >
void insert(iterator position, InputIterator first, InputIterator last);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view. <code class="computeroutput">InputIterator</code>
 is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html" target="_top">Input
@@ -660,100 +638,97 @@
 this view belongs. <code class="computeroutput">last</code>
 is reachable from <code class="computeroutput">first</code>.
 </li>
-<li>
+<li class="listitem">
Effects: <code class="computeroutput">while(first!=last)insert(position,*first++);</code>
</li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
 O(shl(end()-position,m) + m*I(n+m)), where m is the number of elements
 in <code class="computeroutput">[first,last)</code>.
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic.
 </li>
</ul></div>
<a name="reference_vector_of_erase_iterator"></a>
 
-<pre class="programlisting">
-iterator erase(iterator position);
+<pre class="programlisting">iterator erase(iterator position);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid dereferenceable iterator of the view.
 </li>
-<li>
+<li class="listitem">
Effects: Deletes the element pointed
 to by <code class="computeroutput">position</code>.
 </li>
-<li>
+<li class="listitem">
Returns: An iterator pointing to the
 element immediately following the one that was deleted, or <code class="computeroutput">end()</code>
 if no such element exists.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
 O(D(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: nothrow.
 </li>
</ul></div>
<a name="reference_vector_of_erase_iterator_iterator"></a>
 
-<pre class="programlisting">
-iterator erase(iterator first, iterator last);
+<pre class="programlisting">iterator erase(iterator first, iterator last);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">[first,last)</code>
 is a valid range of the view.
 </li>
-<li>
+<li class="listitem">
Effects: Deletes the elements in
 <code class="computeroutput">[first,last)</code>.
 </li>
-<li>
+<li class="listitem">
Returns: last.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
 O(m*D(n)), where m is the number of elements in <code class="computeroutput">[first,last)</code>.
 </li>
-<li>
+<li class="listitem">
Exception safety: nothrow.
 </li>
</ul></div>
<a name="reference_vector_of_replace_iterator_value"></a>
 
-<pre class="programlisting">
-bool replace(iterator position, const value_type & x);
+<pre class="programlisting">bool replace(iterator position, const value_type & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid dereferenceable iterator of the view.
 </li>
-<li>
+<li class="listitem">
Effects: Assigns the value x to the
 element pointed to by position into the <code class="computeroutput">bimap</code>
 to which the view belongs if replacing is allowed by all other views
 of the <code class="computeroutput">bimap</code>.
 </li>
-<li>
+<li class="listitem">
Postconditions: Validity of position
 is preserved in all cases.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">true</code>
 if the replacement took place, <code class="computeroutput">false</code>
 otherwise.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
 O(R(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Strong. If an exception
 is thrown by some user-provided operation the <code class="computeroutput">bimap</code>
 to which the view belongs remains in its original state.
@@ -761,17 +736,16 @@
</ul></div>
<a name="reference_vector_of_replace_key_iterator_key"></a>
 
-<pre class="programlisting">
-template< class CompatibleKey >
+<pre class="programlisting">template< class CompatibleKey >
bool replace_key(iterator position, const CompatibleKey & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid dereferenceable iterator of the set view. <code class="computeroutput">CompatibleKey</code> can be assigned to
 <code class="computeroutput">key_type</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Assigns the value <code class="computeroutput">x</code> to <code class="computeroutput">e.first</code>,
 where <code class="computeroutput">e</code> is the element
 pointed to by <code class="computeroutput">position</code>
@@ -779,20 +753,20 @@
 the set view belongs if replacing is allowed by all other views of
 the <code class="computeroutput">bimap</code>.
 </li>
-<li>
+<li class="listitem">
Postconditions: Validity of position
 is preserved in all cases.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">true</code>
 if the replacement took place, <code class="computeroutput">false</code>
 otherwise.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
 O(R(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Strong. If an exception
 is thrown by some user-provided operation, the <code class="computeroutput">bimap</code>
 to which the set view belongs remains in its original state.
@@ -800,17 +774,16 @@
</ul></div>
<a name="reference_vector_of_replace_data_iterator_data"></a>
 
-<pre class="programlisting">
-template< class CompatibleData >
+<pre class="programlisting">template< class CompatibleData >
bool replace_data(iterator position, const CompatibleData & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid dereferenceable iterator of the set view. <code class="computeroutput">CompatibleKey</code> can be assigned to
 <code class="computeroutput">data_type</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Assigns the value <code class="computeroutput">x</code> to <code class="computeroutput">e.second</code>,
 where <code class="computeroutput">e</code> is the element
 pointed to by <code class="computeroutput">position</code>
@@ -818,20 +791,20 @@
 the set view belongs if replacing is allowed by all other views of
 the <code class="computeroutput">bimap</code>.
 </li>
-<li>
+<li class="listitem">
Postconditions: Validity of position
 is preserved in all cases.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">true</code>
 if the replacement took place, <code class="computeroutput">false</code>
 otherwise.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
 O(R(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Strong. If an exception
 is thrown by some user-provided operation, the <code class="computeroutput">bimap</code>
 to which the set view belongs remains in its original state.
@@ -839,93 +812,90 @@
</ul></div>
<a name="reference_vector_of_modify_key_iterator_modifier"></a>
 
-<pre class="programlisting">
-template< class KeyModifier >
+<pre class="programlisting">template< class KeyModifier >
bool modify_key(iterator position, KeyModifier mod);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">KeyModifier</code>
 is a model of <a href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">Unary
 Function</a> accepting arguments of type: <code class="computeroutput">key_type&</code>; <code class="computeroutput">position</code>
 is a valid dereferenceable iterator of the view.
 </li>
-<li>
+<li class="listitem">
Effects: Calls <code class="computeroutput">mod(e.first)</code> where e is the element pointed to
 by position and rearranges <code class="computeroutput">*position</code> into all the views of the
 <code class="computeroutput">bimap</code>. If the rearrangement
 fails, the element is erased. It is successful if the rearrangement
 is allowed by all other views of the <code class="computeroutput">bimap</code>.
 </li>
-<li>
+<li class="listitem">
Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
 succeeds.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">true</code>
 if the operation succeeded, <code class="computeroutput">false</code>
 otherwise.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
 O(M(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic. If an exception
 is thrown by some user-provided operation (except possibly mod), then
 the element pointed to by position is erased.
 </li>
-<li>
+<li class="listitem">
Note: Only provided for map views.
 </li>
</ul></div>
<a name="reference_vector_of_modify_data_iterator_modifier"></a>
 
-<pre class="programlisting">
-template< class DataModifier >
+<pre class="programlisting">template< class DataModifier >
bool modify_data(iterator position, DataModifier mod);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">DataModifier</code>
 is a model of <a href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">Unary
 Function</a> accepting arguments of type: <code class="computeroutput">data_type&</code>; <code class="computeroutput">position</code>
 is a valid dereferenceable iterator of the view.
 </li>
-<li>
+<li class="listitem">
Effects: Calls <code class="computeroutput">mod(e.second)</code> where e is the element pointed to
 by position and rearranges <code class="computeroutput">*position</code> into all the views of the
 <code class="computeroutput">bimap</code>. If the rearrangement
 fails, the element is erased. It is successful if the rearrangement
 is allowed by all other views of the <code class="computeroutput">bimap</code>.
 </li>
-<li>
+<li class="listitem">
Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
 succeeds.
 </li>
-<li>
+<li class="listitem">
Returns: <code class="computeroutput">true</code>
 if the operation succeeded, <code class="computeroutput">false</code>
 otherwise.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
 O(M(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic. If an exception
 is thrown by some user-provided operation (except possibly mod), then
 the element pointed to by position is erased.
 </li>
-<li>
+<li class="listitem">
Note: Only provided for map views.
 </li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="List operations">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.vector_of_reference.vector_of_views.list_operations"></a><a href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.list_operations" title="List
- operations">List
+<a name="boost_bimap.reference.vector_of_reference.vector_of_views.list_operations"></a><a class="link" href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.list_operations" title="List operations">List
 operations</a>
</h5></div></div></div>

@@ -937,40 +907,38 @@
 
<a name="reference_vector_of_splice_iterator_this"></a>
 
-<pre class="programlisting">
-void splice(iterator position, this_type & x);
+<pre class="programlisting">void splice(iterator position, this_type & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view. <code class="computeroutput">&x!=this</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Inserts the contents of
 <code class="computeroutput">x</code> before position,
 in the same order as they were in <code class="computeroutput">x</code>.
 Those elements successfully inserted are erased from <code class="computeroutput">x</code>.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
 O(shl(end()-position,x.size()) + x.size()*I(n+x.size()) + x.size()*D(x.size())).
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic.
 </li>
</ul></div>
<a name="reference_vector_of_splice_iterator_this_iterator"></a>
 
-<pre class="programlisting">
-void splice(iterator position, this_type & x,iterator i);
+<pre class="programlisting">void splice(iterator position, this_type & x,iterator i);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view. <code class="computeroutput">i</code>
 is a valid dereferenceable iterator <code class="computeroutput">x</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Inserts the element pointed
 to by <code class="computeroutput">i</code> before <code class="computeroutput">position</code>: if insertion is successful,
 the element is erased from <code class="computeroutput">x</code>.
@@ -978,183 +946,176 @@
 and the operation is always successful. If <code class="computeroutput">position==i</code>,
 no operation is performed.
 </li>
-<li>
+<li class="listitem">
Postconditions: If <code class="computeroutput">&x==this</code>, no iterator or reference is invalidated.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
 If <code class="computeroutput">&x==this</code>,
 O(rel(position,i,i+1)); otherwise O(shl(end()-position,1) + I(n) +
 D(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: If <code class="computeroutput">&x==this</code>,
 nothrow; otherwise, strong.
 </li>
</ul></div>
<a name="reference_vector_of_splice_iterator_this_iterator_iterator"></a>
 
-<pre class="programlisting">
-void splice(iterator position, this_type & x, iterator first, iterator last);
+<pre class="programlisting">void splice(iterator position, this_type & x, iterator first, iterator last);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view. <code class="computeroutput">first</code>
 and <code class="computeroutput">last</code> are valid
 iterators of <code class="computeroutput">x</code>. <code class="computeroutput">last</code> is reachable from <code class="computeroutput">first</code>. <code class="computeroutput">position</code>
 is not in the range <code class="computeroutput">[first,last)</code>.
 </li>
-<li>
+<li class="listitem">
Effects: For each element in the range
 <code class="computeroutput">[first,last)</code>, insertion is tried before <code class="computeroutput">position</code>; if the operation is successful,
 the element is erased from <code class="computeroutput">x</code>.
 In the special case <code class="computeroutput">&x==this</code>, no copy or deletion is performed,
 and insertions are always successful.
 </li>
-<li>
+<li class="listitem">
Postconditions: If <code class="computeroutput">&x==this</code>, no iterator or reference is invalidated.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
 If <code class="computeroutput">&x==this</code>,
 O(rel(position,first,last)); otherwise O(shl(end()-position,m) + m*I(n+m)
 + m*D(x.size())) where m is the number of elements in <code class="computeroutput">[first,last)</code>.
 </li>
-<li>
+<li class="listitem">
Exception safety: If <code class="computeroutput">&x==this</code>,
 nothrow; otherwise, basic.
 </li>
</ul></div>
<a name="reference_vector_of_remove_value"></a>
 
-<pre class="programlisting">
-void remove(const value_type & value);
+<pre class="programlisting">void remove(const value_type & value);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: Erases all elements of the
 view which compare equal to <code class="computeroutput">value</code>.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
 O(n + m*D(n)), where m is the number of elements erased.
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic.
 </li>
</ul></div>
<a name="reference_vector_of_remove_if_predicate"></a>
 
-<pre class="programlisting">
-template< class Predicate >
+<pre class="programlisting">template< class Predicate >
void remove_if(Predicate pred);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: Erases all elements <code class="computeroutput">x</code> of the view for which <code class="computeroutput">pred(x)</code>
 holds.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
 O(n + m*D(n)), where m is the number of elements erased.
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic.
 </li>
</ul></div>
<a name="reference_vector_of_unique"></a>
 
-<pre class="programlisting">
-void unique();
+<pre class="programlisting">void unique();
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: Eliminates all but the first
 element from every consecutive group of equal elements referred to
 by the iterator <code class="computeroutput">i</code> in
 the range <code class="computeroutput">[first+1,last)</code>
 for which <code class="computeroutput">*i==*(i-1)</code>.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
 O(n + m*D(n)), where m is the number of elements erased.
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic.
 </li>
</ul></div>
<a name="reference_vector_of_unique_predicate"></a>
 
-<pre class="programlisting">
-template< class BinaryPredicate >
+<pre class="programlisting">template< class BinaryPredicate >
void unique(BinaryPredicate binary_pred);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: Eliminates all but the first
 element from every consecutive group of elements referred to by the
 iterator i in the range <code class="computeroutput">[first+1,last)</code> for which <code class="computeroutput">binary_pred(*i, *(i-1))</code> holds.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
 O(n + m*D(n)), where m is the number of elements erased.
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic.
 </li>
</ul></div>
<a name="reference_vector_of_merge_this"></a>
 
-<pre class="programlisting">
-void merge(this_type & x);
+<pre class="programlisting">void merge(this_type & x);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">std::less<value_type></code> is a <a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html" target="_top">Strict
 Weak Ordering</a> over <code class="computeroutput">value_type</code>.
 Both the view and <code class="computeroutput">x</code>
 are sorted according to <code class="computeroutput">std::less<value_type></code>.
 </li>
-<li>
+<li class="listitem">
Effects: Attempts to insert every
 element of x into the corresponding position of the view (according
 to the order). Elements successfully inserted are erased from <code class="computeroutput">x</code>. The resulting sequence is stable,
 i.e. equivalent elements of either container preserve their relative
 position. In the special case <code class="computeroutput">&x==this</code>, no operation is performed.
 </li>
-<li>
+<li class="listitem">
Postconditions: Elements in the view
 and remaining elements in <code class="computeroutput">x</code>
 are sorted. Validity of iterators to the view and of non-erased elements
 of <code class="computeroutput">x</code> references is
 preserved.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
 If <code class="computeroutput">&x==this</code>,
 constant; otherwise O(n + x.size()*I(n+x.size()) + x.size()*D(x.size())).
 </li>
-<li>
+<li class="listitem">
Exception safety: If <code class="computeroutput">&x==this</code>,
 nothrow; otherwise, basic.
 </li>
</ul></div>
<a name="reference_vector_of_merge_this_compare"></a>
 
-<pre class="programlisting">
-template< class Compare >
+<pre class="programlisting">template< class Compare >
void merge(this_type & x, Compare comp);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">Compare</code>
 is a <a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html" target="_top">Strict
 Weak Ordering</a> over <code class="computeroutput">value_type</code>.
 Both the view and <code class="computeroutput">x</code>
 are sorted according to comp.
 </li>
-<li>
+<li class="listitem">
Effects: Attempts to insert every
 element of <code class="computeroutput">x</code> into the
 corresponding position of the view (according to <code class="computeroutput">comp</code>).
@@ -1163,102 +1124,98 @@
 container preserve their relative position. In the special case <code class="computeroutput">&x==this</code>,
 no operation is performed.
 </li>
-<li>
+<li class="listitem">
Postconditions: Elements in the view
 and remaining elements in <code class="computeroutput">x</code>
 are sorted according to <code class="computeroutput">comp</code>.
 Validity of iterators to the view and of non-erased elements of <code class="computeroutput">x</code> references is preserved.
 </li>
-<li>
-Complexity:
+<li class="listitem">
+<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
 If <code class="computeroutput">&x==this</code>,
 constant; otherwise O(n + x.size()*I(n+x.size()) + x.size()*D(x.size())).
 </li>
-<li>
+<li class="listitem">
Exception safety: If <code class="computeroutput">&x==this</code>,
 nothrow; otherwise, basic.
 </li>
</ul></div>
<a name="reference_vector_of_sort"></a>
 
-<pre class="programlisting">
-void sort();
+<pre class="programlisting">void sort();
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">std::less<value_type></code> is a <a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html" target="_top">Strict
 Weak Ordering</a> over <code class="computeroutput">value_type</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Sorts the view according
 to <code class="computeroutput">std::less<value_type></code>.
 The sorting is stable, i.e. equivalent elements preserve their relative
 position.
 </li>
-<li>
+<li class="listitem">
Postconditions: Validity of iterators
 and references is preserved.
 </li>
-<li>
+<li class="listitem">
Complexity: O(n*log(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic.
 </li>
</ul></div>
<a name="reference_vector_of_sort_compare"></a>
 
-<pre class="programlisting">
-template< class Compare >
+<pre class="programlisting">template< class Compare >
void sort(Compare comp);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: Compare is a <a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html" target="_top">Strict
 Weak Ordering</a> over <code class="computeroutput">value_type</code>.
 </li>
-<li>
+<li class="listitem">
Effects: Sorts the view according
 to <code class="computeroutput">comp</code>. The sorting
 is stable, i.e. equivalent elements preserve their relative position.
 </li>
-<li>
+<li class="listitem">
Postconditions: Validity of iterators
 and references is preserved.
 </li>
-<li>
+<li class="listitem">
Complexity: O(n*log(n)).
 </li>
-<li>
+<li class="listitem">
Exception safety: Basic.
 </li>
</ul></div>
<a name="reference_vector_of_reverse"></a>
 
-<pre class="programlisting">
-void reverse();
+<pre class="programlisting">void reverse();
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Effects: Reverses the order of the
 elements in the view.
 </li>
-<li>
+<li class="listitem">
Postconditions: Validity of iterators
 and references is preserved.
 </li>
-<li>
+<li class="listitem">
Complexity: O(n).
 </li>
-<li>
+<li class="listitem">
Exception safety: nothrow.
 </li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Rearrange operations">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.vector_of_reference.vector_of_views.rearrange_operations"></a><a href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.rearrange_operations" title="Rearrange
- operations">Rearrange
+<a name="boost_bimap.reference.vector_of_reference.vector_of_views.rearrange_operations"></a><a class="link" href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.rearrange_operations" title="Rearrange operations">Rearrange
 operations</a>
</h5></div></div></div>

@@ -1268,38 +1225,36 @@
 
<a name="reference_vector_of_relocate_iterator_iterator"></a>
 
-<pre class="programlisting">
-void relocate(iterator position, iterator i);
+<pre class="programlisting">void relocate(iterator position, iterator i);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view. <code class="computeroutput">i</code>
 is a valid dereferenceable iterator of the view.
 </li>
-<li>
+<li class="listitem">
Effects: Inserts the element pointed
 to by <code class="computeroutput">i</code> before <code class="computeroutput">position</code>. If <code class="computeroutput">position==i</code>,
 no operation is performed.
 </li>
-<li>
+<li class="listitem">
Postconditions: No iterator or reference
 is invalidated.
 </li>
-<li>
+<li class="listitem">
Complexity: Constant.
 </li>
-<li>
+<li class="listitem">
Exception safety: nothrow.
 </li>
</ul></div>
<a name="reference_vector_of_relocate_iterator_iterator_iterator"></a>
 
-<pre class="programlisting">
-void relocate(iterator position, iterator first, iterator last);
+<pre class="programlisting">void relocate(iterator position, iterator first, iterator last);
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view. <code class="computeroutput">first</code>
 and <code class="computeroutput">last</code> are valid
@@ -1308,24 +1263,24 @@
 <code class="computeroutput">position</code> is not in
 the range <code class="computeroutput">[first,last)</code>.
 </li>
-<li>
+<li class="listitem">
Effects: The range of elements <code class="computeroutput">[first,last)</code> is repositioned just before <code class="computeroutput">position</code>.
 </li>
-<li>
+<li class="listitem">
Postconditions: No iterator or reference
 is invalidated.
 </li>
-<li>
+<li class="listitem">
Complexity: Constant.
 </li>
-<li>
+<li class="listitem">
Exception safety: nothrow.
 </li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Serialization">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.vector_of_reference.vector_of_views.serialization"></a>Serialization
+<a name="boost_bimap.reference.vector_of_reference.vector_of_views.serialization"></a><a class="link" href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.serialization" title="Serialization">Serialization</a>
</h5></div></div></div>

 Views cannot be serialized on their own, but only as part of the <code class="computeroutput">bimap</code> into which they are embedded.
@@ -1335,24 +1290,30 @@
 defined in the <code class="computeroutput">bimap</code>
 serialization section.
 
-<div class="sidebar">
+<div class="sidebar">
+
+
 Operation: saving of a <code class="computeroutput">bimap</code> b to an output archive (XML archive)
 ar.
- </div>
-<div class="itemizedlist"><ul type="disc"><li>
+ 
+</div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
Requires: No additional requirements
 to those imposed by the container.
 </li></ul></div>
-<div class="sidebar">
+<div class="sidebar">
+
+
 Operation: loading of a <code class="computeroutput">bimap</code> b' from an input archive (XML
 archive) ar.
- </div>
-<div class="itemizedlist"><ul type="disc">
-<li>
+ 
+</div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Requires: No additional requirements
 to those imposed by the container.
 </li>
-<li>
+<li class="listitem">
Postconditions: On successful loading,
 each of the elements of <code class="computeroutput">[begin(),
 end())</code>
@@ -1363,28 +1324,34 @@
 in the container.
 </li>
</ul></div>
-<div class="sidebar">
+<div class="sidebar">
+
+
 Operation: saving of an <code class="computeroutput">iterator</code> or <code class="computeroutput">const_iterator</code>
 <code class="computeroutput">it</code> to an output archive
 (XML archive) ar.
- </div>
-<div class="itemizedlist"><ul type="disc"><li>
+ 
+</div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
Requires: <code class="computeroutput">it</code>
 is a valid iterator of the view. The associated <code class="computeroutput">bimap</code>
 has been previously saved.
 </li></ul></div>
-<div class="sidebar">
+<div class="sidebar">
+
+
 Operation: loading of an <code class="computeroutput">iterator</code> or <code class="computeroutput">const_iterator</code>
 <code class="computeroutput">it</code>' from an input archive
 (XML archive) ar.
- </div>
-<div class="itemizedlist"><ul type="disc">
-<li>
+ 
+</div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
Postconditions: On successful loading,
 if it was dereferenceable then <code class="computeroutput">*it</code>' is the restored copy of <code class="computeroutput">*it</code>,
 otherwise <code class="computeroutput">it</code>'<code class="computeroutput">==end()</code>.
 </li>
-<li>
+<li class="listitem">
Note: It is allowed that it be a
 <code class="computeroutput">const_iterator</code> and
 the restored <code class="computeroutput">it</code>' an

Modified: trunk/libs/bimap/doc/html/boost_bimap/release_notes.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/release_notes.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/release_notes.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -3,8 +3,8 @@
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>Release notes</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="prev" href="future_work.html" title="Future work">
<link rel="next" href="rationale.html" title="Rationale">
@@ -12,19 +12,19 @@
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="future_work.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="rationale.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="Release notes">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="boost_bimap.release_notes"></a>Release notes
+<a name="boost_bimap.release_notes"></a><a class="link" href="release_notes.html" title="Release notes">Release notes</a>
</h2></div></div></div>

Not yet released.

Modified: trunk/libs/bimap/doc/html/boost_bimap/test_suite.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/test_suite.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/test_suite.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -3,29 +3,28 @@
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>Test suite</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
-<link rel="prev" href="examples/multiindex_to_bimap_path___hashed_indices.html" title="MultiIndex
- to Bimap Path - Hashed indices">
+<link rel="prev" href="examples/multiindex_to_bimap_path___hashed_indices.html" title="MultiIndex to Bimap Path - Hashed indices">
<link rel="next" href="future_work.html" title="Future work">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="examples/multiindex_to_bimap_path___hashed_indices.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="future_work.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="Test suite">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="boost_bimap.test_suite"></a>Test suite
+<a name="boost_bimap.test_suite"></a><a class="link" href="test_suite.html" title="Test suite">Test suite</a>
</h2></div></div></div>

The Boost.Bimap test suite exercises the whole spectrum of functionalities

Modified: trunk/libs/bimap/doc/html/boost_bimap/the_tutorial.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/the_tutorial.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/the_tutorial.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -3,29 +3,28 @@
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>The tutorial</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="prev" href="one_minute_tutorial.html" title="One minute tutorial">
-<link rel="next" href="the_tutorial/discovering_the_bimap_framework.html" title="Discovering
- the bimap framework">
+<link rel="next" href="the_tutorial/discovering_the_bimap_framework.html" title="Discovering the bimap framework">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="one_minute_tutorial.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="the_tutorial/discovering_the_bimap_framework.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="The tutorial">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="boost_bimap.the_tutorial"></a>The tutorial
+<a name="boost_bimap.the_tutorial"></a><a class="link" href="the_tutorial.html" title="The tutorial">The tutorial</a>
</h2></div></div></div>
<div class="toc"><dl>
<dt>Roadmap</dt>
@@ -85,68 +84,60 @@
<dt><a href="the_tutorial/complete_instantiation_scheme.html">Complete
 instantiation scheme</a></dt>
</dl></div>
-<div class="section" lang="en">
+<div class="section" title="Roadmap">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.the_tutorial.roadmap"></a>Roadmap
+<a name="boost_bimap.the_tutorial.roadmap"></a><a class="link" href="the_tutorial.html#boost_bimap.the_tutorial.roadmap" title="Roadmap">Roadmap</a>
</h3></div></div></div>
-<div class="orderedlist"><ol type="1">
-<li>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
 Boost.Bimap is intuitive because it is based on the standard template library.
 New concepts are however presented to extend the standard maps to bidirectional
 maps. The first step is to gain a firm grasp of the bimap framework. The
- first section (<a href="the_tutorial/discovering_the_bimap_framework.html" title="Discovering
- the bimap framework">Discovering
+ first section (<a class="link" href="the_tutorial/discovering_the_bimap_framework.html" title="Discovering the bimap framework">Discovering
 the bimap framework</a>) aims to explain this.
 </li>
-<li>
+<li class="listitem">
 Boost.Bimap offers much more than just a one-to-one ordered unique bidirectional
 map. It is possible to control the collection type of each side of the
 relationship that the bimap represents, giving one-to-many containers,
 hashed bidirectional containers and others that may be more suitable to
- the the task at hand. The second section (<a href="the_tutorial/controlling_collection_types.html" title="Controlling
- collection types">Controlling
+ the the task at hand. The second section (<a class="link" href="the_tutorial/controlling_collection_types.html" title="Controlling collection types">Controlling
 collection types</a>) explains how to instantiate a bimap with different
 collection constraints.
 </li>
-<li>
- The section (<a href="the_tutorial/the_collection_of_relations_type.html" title="The
- collection of relations type">The
+<li class="listitem">
+ The section (<a class="link" href="the_tutorial/the_collection_of_relations_type.html" title="The collection of relations type">The
 "collection of relations" type</a>) explains how to create
 new types of bidirectional maps using custom collection types.
 </li>
-<li>
- In the section <a href="the_tutorial/differences_with_standard_maps.html" title="Differences
- with standard maps">Differences
+<li class="listitem">
+ In the section <a class="link" href="the_tutorial/differences_with_standard_maps.html" title="Differences with standard maps">Differences
 with standard maps</a> we will learn about the subtle differences between
 a bimap map view and a standard map.
 </li>
-<li>
- The section <a href="the_tutorial/useful_functions.html" title="Useful functions">Useful
+<li class="listitem">
+ The section <a class="link" href="the_tutorial/useful_functions.html" title="Useful functions">Useful
 functions</a> provides information about functions of a bimap that are
 not found in the STL.
 </li>
-<li>
+<li class="listitem">
 The types of a bimap can be tagged so that each side is accessible by something
 closer to the problem than left and right. This leads to more readable,
- self-documenting code. The fourth section (<a href="the_tutorial/bimaps_with_user_defined_names.html" title="Bimaps
- with user defined names">Bimaps
+ self-documenting code. The fourth section (<a class="link" href="the_tutorial/bimaps_with_user_defined_names.html" title="Bimaps with user defined names">Bimaps
 with user defined names</a>) shows how to use this feature.
 </li>
-<li>
+<li class="listitem">
 The bimap mapping framework allows to disable a view of a bimap, including
- the standard mapping containers as a particular case. The section <a href="the_tutorial/unconstrained_sets.html" title="Unconstrained
- Sets">Unconstrained Sets</a>
+ the standard mapping containers as a particular case. The section <a class="link" href="the_tutorial/unconstrained_sets.html" title="Unconstrained Sets">Unconstrained Sets</a>
 explains how they work.
 </li>
-<li>
- The section <a href="the_tutorial/additional_information.html" title="Additional
- information">Additional
+<li class="listitem">
+ The section <a class="link" href="the_tutorial/additional_information.html" title="Additional information">Additional
 information</a> explains how to attach information to each relation
 of a bimap.
 </li>
-<li>
- The final section (<a href="the_tutorial/complete_instantiation_scheme.html" title="Complete
- instantiation scheme">Complete
+<li class="listitem">
+ The final section (<a class="link" href="the_tutorial/complete_instantiation_scheme.html" title="Complete instantiation scheme">Complete
 Instantiation Scheme</a>) summarizes bimap instantiation and explains
 how change the allocator type to be used.
 </li>

Modified: trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/additional_information.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/additional_information.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/additional_information.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -1,34 +1,30 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Additional
- information</title>
+<title>Additional information</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../the_tutorial.html" title="The tutorial">
-<link rel="prev" href="unconstrained_sets.html" title="Unconstrained
- Sets">
-<link rel="next" href="complete_instantiation_scheme.html" title="Complete
- instantiation scheme">
+<link rel="prev" href="unconstrained_sets.html" title="Unconstrained Sets">
+<link rel="next" href="complete_instantiation_scheme.html" title="Complete instantiation scheme">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="unconstrained_sets.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="complete_instantiation_scheme.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="Additional information">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.the_tutorial.additional_information"></a><a href="additional_information.html" title="Additional
- information">Additional
+<a name="boost_bimap.the_tutorial.additional_information"></a><a class="link" href="additional_information.html" title="Additional information">Additional
 information</a>
</h3></div></div></div>

@@ -40,8 +36,7 @@



-<pre class="programlisting">
-typedef bimap<
+<pre class="programlisting">typedef bimap<

 multiset_of< std::string >, // author
 set_of< std::string > // title
@@ -65,12 +60,12 @@

 Suppose now that we want to store abstract of each book. We have two options:
 
-<div class="orderedlist"><ol type="1">
-<li>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
 Books name are unique identifiers, so we can create a separate <code class="computeroutput">std::map< string, string ></code>
 that relates books names with abstracts.
 </li>
-<li>
+<li class="listitem">
 We can use Boost.MultiIndex for the new beast.
 </li>
</ol></div>
@@ -114,8 +109,7 @@



-<pre class="programlisting">
-typedef bimap<
+<pre class="programlisting">typedef bimap<

 multiset_of< std::string >, // author
 set_of< std::string >, // title
@@ -155,8 +149,7 @@



-<pre class="programlisting">
-i->info += "More details about this book";
+<pre class="programlisting">i->info += "More details about this book";
</pre>

 
@@ -172,8 +165,7 @@



-<pre class="programlisting">
-// Print the new abstract
+<pre class="programlisting">// Print the new abstract
std::cout << bm.right.info_at("The C++ Programming Language");
</pre>

@@ -189,8 +181,7 @@



-<pre class="programlisting">
-typedef bimap<
+<pre class="programlisting">typedef bimap<

 multiset_of< tagged< std::string, author > >,
 set_of< tagged< std::string, title > >,

Modified: trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/bimaps_with_user_defined_names.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/bimaps_with_user_defined_names.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/bimaps_with_user_defined_names.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -1,33 +1,30 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Bimaps
- with user defined names</title>
+<title>Bimaps with user defined names</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../the_tutorial.html" title="The tutorial">
<link rel="prev" href="useful_functions.html" title="Useful functions">
-<link rel="next" href="unconstrained_sets.html" title="Unconstrained
- Sets">
+<link rel="next" href="unconstrained_sets.html" title="Unconstrained Sets">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="useful_functions.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="unconstrained_sets.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="Bimaps with user defined names">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.the_tutorial.bimaps_with_user_defined_names"></a><a href="bimaps_with_user_defined_names.html" title="Bimaps
- with user defined names">Bimaps
+<a name="boost_bimap.the_tutorial.bimaps_with_user_defined_names"></a><a class="link" href="bimaps_with_user_defined_names.html" title="Bimaps with user defined names">Bimaps
 with user defined names</a>
</h3></div></div></div>

@@ -42,8 +39,7 @@



-<pre class="programlisting">
-typedef bimap
+<pre class="programlisting">typedef bimap
<
 multiset_of<std::string>,
 int
@@ -109,8 +105,7 @@
 In order to specify a custom tag, the type of each side has to be tagged.
 Tagging a type is very simple:
 
-<pre class="programlisting">
-typedef tagged< int, a_tag > tagged_int;
+<pre class="programlisting">typedef tagged< int, a_tag > tagged_int;
</pre>

 Now we can rewrite the example:
@@ -123,8 +118,7 @@



-<pre class="programlisting">
-struct id {}; // Tag for the identification number
+<pre class="programlisting">struct id {}; // Tag for the identification number
struct name {}; // Tag for the name of the person

typedef bimap
@@ -171,8 +165,7 @@
 Remember that when the bimap has user defined tags you can still use the
 untagged version structures.
 
-<pre class="programlisting">
-struct Left {};
+<pre class="programlisting">struct Left {};
struct Right {};
typedef bimap<
 multiset_of< tagged< int, Left > >,
@@ -188,7 +181,7 @@
bm_type::right_iterator right_iter = bm.right.begin();
</pre>
<div class="table">
-<a name="id2638349"></a>Table 1.3. Equivalence of expresions using user defined names
+<a name="id577416"></a>Table 1.3. Equivalence of expresions using user defined names
<div class="table-contents"><table class="table" summary="Equivalence of expresions using user defined names">
<colgroup>
<col>

Modified: trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/complete_instantiation_scheme.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/complete_instantiation_scheme.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/complete_instantiation_scheme.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -1,40 +1,36 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Complete
- instantiation scheme</title>
+<title>Complete instantiation scheme</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../the_tutorial.html" title="The tutorial">
-<link rel="prev" href="additional_information.html" title="Additional
- information">
+<link rel="prev" href="additional_information.html" title="Additional information">
<link rel="next" href="../bimap_and_boost.html" title="Bimap and Boost">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="additional_information.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../bimap_and_boost.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="Complete instantiation scheme">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.the_tutorial.complete_instantiation_scheme"></a><a href="complete_instantiation_scheme.html" title="Complete
- instantiation scheme">Complete
+<a name="boost_bimap.the_tutorial.complete_instantiation_scheme"></a><a class="link" href="complete_instantiation_scheme.html" title="Complete instantiation scheme">Complete
 instantiation scheme</a>
</h3></div></div></div>

 To summarize, this is the complete instantiation scheme.
 
-<pre class="programlisting">
-typedef bimap
+<pre class="programlisting">typedef bimap
<
 LeftCollectionType, RightCollectionType

@@ -53,62 +49,58 @@

 The possibles way to use the first parameter are:
 
-<pre class="programlisting">
-bimap< Type, R >
+<pre class="programlisting">bimap< Type, R >
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 Left type: <code class="computeroutput">Type</code>
</li>
-<li>
+<li class="listitem">
 Left collection type: <code class="computeroutput">set_of< Type ></code>
</li>
-<li>
+<li class="listitem">
 Left tag: <code class="computeroutput">member_at::left</code>
</li>
</ul></div>
-<pre class="programlisting">
-bimap< {CollectionType}_of< Type >, R >
+<pre class="programlisting">bimap< {CollectionType}_of< Type >, R >
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 Left type: <code class="computeroutput">Type</code>
</li>
-<li>
+<li class="listitem">
 Left collection type: <code class="computeroutput">{CollectionType}_of< LeftType
 ></code>
</li>
-<li>
+<li class="listitem">
 Left tag: <code class="computeroutput">member_at::left</code>
</li>
</ul></div>
-<pre class="programlisting">
-bimap< tagged< Type, Tag >, R >
+<pre class="programlisting">bimap< tagged< Type, Tag >, R >
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 Left type: <code class="computeroutput">Type</code>
</li>
-<li>
+<li class="listitem">
 Left collection type: <code class="computeroutput">set_of< LeftType
 ></code>
</li>
-<li>
+<li class="listitem">
 Left tag: <code class="computeroutput">Tag</code>
</li>
</ul></div>
-<pre class="programlisting">
-bimap< {CollectionType}_of< tagged< Type, Tag > >, R >
+<pre class="programlisting">bimap< {CollectionType}_of< tagged< Type, Tag > >, R >
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 Left type: <code class="computeroutput">Type</code>
</li>
-<li>
+<li class="listitem">
 Left collection type: <code class="computeroutput">{CollectionType}_of< LeftType
 ></code>
</li>
-<li>
+<li class="listitem">
 Left tag: <code class="computeroutput">Tag</code>
</li>
</ul></div>
@@ -131,112 +123,104 @@
 The following are the possible ways of instantiating the last three parameters
 of a bimap. You can ignore some of the parameter but the order must be respected.
 
-<pre class="programlisting">
-bimap< L, R >
+<pre class="programlisting">bimap< L, R >
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 set_of_relation_type: based on the left key type
 </li>
-<li>
+<li class="listitem">
 info: no info
 </li>
-<li>
+<li class="listitem">
 allocator: std::allocator
 </li>
</ul></div>
-<pre class="programlisting">
-bimap< L, R ,SetOfRelationType>
+<pre class="programlisting">bimap< L, R ,SetOfRelationType>
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 set_of_relation_type: SetOfRelationType
 </li>
-<li>
+<li class="listitem">
 info: no info
 </li>
-<li>
+<li class="listitem">
 allocator: std::allocator
 </li>
</ul></div>
-<pre class="programlisting">
-bimap< L, R , SetOfRelationType, with_info<Info> >
+<pre class="programlisting">bimap< L, R , SetOfRelationType, with_info<Info> >
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 set_of_relation_type: SetOfRelationType
 </li>
-<li>
+<li class="listitem">
 info: Info
 </li>
-<li>
+<li class="listitem">
 allocator: std::allocator
 </li>
</ul></div>
-<pre class="programlisting">
-bimap< L, R , SetOfRelationType, with_info<Info>, Allocator>
+<pre class="programlisting">bimap< L, R , SetOfRelationType, with_info<Info>, Allocator>
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 set_of_relation_type: SetOfRelationType
 </li>
-<li>
+<li class="listitem">
 info: Info
 </li>
-<li>
+<li class="listitem">
 allocator: Allocator
 </li>
</ul></div>
-<pre class="programlisting">
-bimap< L, R , SetOfRelationType, Allocator>
+<pre class="programlisting">bimap< L, R , SetOfRelationType, Allocator>
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 set_of_relation_type: SetOfRelationType
 </li>
-<li>
+<li class="listitem">
 info: no info
 </li>
-<li>
+<li class="listitem">
 allocator: Allocator
 </li>
</ul></div>
-<pre class="programlisting">
-bimap< L, R , with_info<Info> >
+<pre class="programlisting">bimap< L, R , with_info<Info> >
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 set_of_relation_type: based on the left key type
 </li>
-<li>
+<li class="listitem">
 info: Info
 </li>
-<li>
+<li class="listitem">
 allocator: std::allocator
 </li>
</ul></div>
-<pre class="programlisting">
-bimap< L, R , with_info<Info>, Allocator>
+<pre class="programlisting">bimap< L, R , with_info<Info>, Allocator>
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 set_of_relation_type: based on the left key type
 </li>
-<li>
+<li class="listitem">
 allocator: Allocator
 </li>
</ul></div>
-<pre class="programlisting">
-bimap< L, R , Allocator>
+<pre class="programlisting">bimap< L, R , Allocator>
</pre>
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 set_of_relation_type: based on the left key type
 </li>
-<li>
+<li class="listitem">
 info: no info
 </li>
-<li>
+<li class="listitem">
 allocator: Allocator
 </li>
</ul></div>

Modified: trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/controlling_collection_types.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/controlling_collection_types.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/controlling_collection_types.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -1,34 +1,30 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Controlling
- collection types</title>
+<title>Controlling collection types</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../the_tutorial.html" title="The tutorial">
-<link rel="prev" href="discovering_the_bimap_framework.html" title="Discovering
- the bimap framework">
-<link rel="next" href="the_collection_of_relations_type.html" title="The
- collection of relations type">
+<link rel="prev" href="discovering_the_bimap_framework.html" title="Discovering the bimap framework">
+<link rel="next" href="the_collection_of_relations_type.html" title="The collection of relations type">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="discovering_the_bimap_framework.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="the_collection_of_relations_type.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="Controlling collection types">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.the_tutorial.controlling_collection_types"></a><a href="controlling_collection_types.html" title="Controlling
- collection types">Controlling
+<a name="boost_bimap.the_tutorial.controlling_collection_types"></a><a class="link" href="controlling_collection_types.html" title="Controlling collection types">Controlling
 collection types</a>
</h3></div></div></div>
<div class="toc"><dl>
@@ -38,10 +34,9 @@
 parameters</a></dt>
<dt>Examples</dt>
</dl></div>
-<div class="section" lang="en">
+<div class="section" title="Freedom of choice">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.the_tutorial.controlling_collection_types.freedom_of_choice"></a><a href="controlling_collection_types.html#boost_bimap.the_tutorial.controlling_collection_types.freedom_of_choice" title="Freedom
- of choice">Freedom
+<a name="boost_bimap.the_tutorial.controlling_collection_types.freedom_of_choice"></a><a class="link" href="controlling_collection_types.html#boost_bimap.the_tutorial.controlling_collection_types.freedom_of_choice" title="Freedom of choice">Freedom
 of choice</a>
</h4></div></div></div>

@@ -58,14 +53,13 @@
 collection is a set. The instantiation of a bimap with custom collection
 types looks like this:
 
-<pre class="programlisting">
-typedef bimap< CollectionType_of<A>, CollectionType_of<B> > bm_type;
+<pre class="programlisting">typedef bimap< CollectionType_of<A>, CollectionType_of<B> > bm_type;
</pre>

 The following is the list of all supported collection types.
 
<div class="table">
-<a name="id2621928"></a>Table 1.2. Collection of Key Types
+<a name="id561624"></a>Table 1.2. Collection of Key Types
<div class="table-contents"><table class="table" summary="Collection of Key Types">
<colgroup>
<col>
@@ -226,29 +220,27 @@
 you can perform with each side of the bimap and the time it takes to do
 each. If we have:
 
-<pre class="programlisting">
-typedef bimap< CollectionType_of<A>, CollectionType_of<B> > bm_type;
+<pre class="programlisting">typedef bimap< CollectionType_of<A>, CollectionType_of<B> > bm_type;
bm_type bm;
</pre>

 The following now describes the resulting map views of the bidirectional
 map.
 
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
<code class="computeroutput">bm.left</code> is signature-compatible with
 LeftMapType<code class="computeroutput"><A,B></code>
</li>
-<li>
+<li class="listitem">
<code class="computeroutput">bm.right</code> is signature-compatible with
 RightMapType<code class="computeroutput"><B,A></code>
</li>
</ul></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Configuration parameters">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.the_tutorial.controlling_collection_types.configuration_parameters"></a><a href="controlling_collection_types.html#boost_bimap.the_tutorial.controlling_collection_types.configuration_parameters" title="Configuration
- parameters">Configuration
+<a name="boost_bimap.the_tutorial.controlling_collection_types.configuration_parameters"></a><a class="link" href="controlling_collection_types.html#boost_bimap.the_tutorial.controlling_collection_types.configuration_parameters" title="Configuration parameters">Configuration
 parameters</a>
</h4></div></div></div>

@@ -355,31 +347,30 @@
</tbody>
</table></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Examples">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.the_tutorial.controlling_collection_types.examples"></a>Examples
+<a name="boost_bimap.the_tutorial.controlling_collection_types.examples"></a><a class="link" href="controlling_collection_types.html#boost_bimap.the_tutorial.controlling_collection_types.examples" title="Examples">Examples</a>
</h4></div></div></div>
<a name="boost_bimap.the_tutorial.controlling_collection_types.examples.countries_populations"></a><h6>
-<a name="id2623142"></a>
- <a href="controlling_collection_types.html#boost_bimap.the_tutorial.controlling_collection_types.examples.countries_populations">Countries
+<a name="id562688"></a>
+ <a class="link" href="controlling_collection_types.html#boost_bimap.the_tutorial.controlling_collection_types.examples.countries_populations">Countries
 Populations</a>
 </h6>

 We want to store countries populations. The requeriments are:
 
-<div class="orderedlist"><ol type="1">
-<li>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
 Get a list of countries in decresing order of their populations.
 </li>
-<li>
+<li class="listitem">
 Given a countrie, get their population.
 </li>
</ol></div>

 Lets create the appropiate bimap.
 
-<pre class="programlisting">
-typedef bimap<
+<pre class="programlisting">typedef bimap<

 unordered_set_of< std::string >,
 multiset_of< long, std::greater<long> >
@@ -407,8 +398,7 @@



-<pre class="programlisting">
-typedef bimap<
+<pre class="programlisting">typedef bimap<

 unordered_set_of< std::string >,
 multiset_of< long, std::greater<long> >
@@ -428,7 +418,7 @@
std::cout << "Countries by their population:" << std::endl;

// First requirement
-<a name="boost_bimap4co" href="controlling_collection_types.html#boost_bimap4"><img src="../../images/callouts/1.png" alt="1" border="0"></a>for( population_bimap::right_const_iterator
+<a class="co" name="boost_bimap4co" href="controlling_collection_types.html#boost_bimap4"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>for( population_bimap::right_const_iterator
 i = pop.right.begin(), iend = pop.right.end();
 i != iend ; ++i )
{
@@ -436,7 +426,7 @@
}

// Second requirement
-<a name="boost_bimap5co" href="controlling_collection_types.html#boost_bimap5"><img src="../../images/callouts/2.png" alt="2" border="0"></a>std::cout << "Population of China: " << pop.left.at("China") << std::endl;
+<a class="co" name="boost_bimap5co" href="controlling_collection_types.html#boost_bimap5"><img src="../../../../../../doc/src/images/callouts/2.png" alt="2" border="0"></a>std::cout << "Population of China: " << pop.left.at("China") << std::endl;
</pre>

 
@@ -446,14 +436,12 @@
 
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
-<td width="5%" valign="top" align="left">
-<a name="boost_bimap4"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap4"></a> </td>
<td valign="top" align="left"> The right map view works like a <code class="computeroutput">std::multimap< long, std::string, std::greater<long> ></code>,
 We can iterate over it to print the results in the required order. </td>
</tr>
<tr>
-<td width="5%" valign="top" align="left">
-<a name="boost_bimap5"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap5"></a> </td>
<td valign="top" align="left"> The
 left map view works like a <code class="computeroutput">std::unordered_map< std::string, long ></code>, given the name of the country we
 can use it to search for the population in constant time </td>
@@ -464,8 +452,8 @@

 
<a name="boost_bimap.the_tutorial.controlling_collection_types.examples.repetitions_counter"></a><h6>
-<a name="id2624476"></a>
- <a href="controlling_collection_types.html#boost_bimap.the_tutorial.controlling_collection_types.examples.repetitions_counter">Repetitions
+<a name="id563860"></a>
+ <a class="link" href="controlling_collection_types.html#boost_bimap.the_tutorial.controlling_collection_types.examples.repetitions_counter">Repetitions
 counter</a>
 </h6>

@@ -480,11 +468,10 @@



-<pre class="programlisting">
-typedef bimap
+<pre class="programlisting">typedef bimap
<
 unordered_set_of< std::string >,
- list_of< counter > <a name="boost_bimap6co" href="controlling_collection_types.html#boost_bimap6"><img src="../../images/callouts/1.png" alt="1" border="0"></a>
+ list_of< counter > <a class="co" name="boost_bimap6co" href="controlling_collection_types.html#boost_bimap6"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>

> word_counter;

@@ -505,11 +492,11 @@
for( text_tokenizer::const_iterator it = tok.begin(), it_end = tok.end();
 it != it_end ; ++it )
{
- <a name="boost_bimap7co" href="controlling_collection_types.html#boost_bimap7"><img src="../../images/callouts/2.png" alt="2" border="0"></a>++ wc.left[*it];
+ <a class="co" name="boost_bimap7co" href="controlling_collection_types.html#boost_bimap7"><img src="../../../../../../doc/src/images/callouts/2.png" alt="2" border="0"></a>++ wc.left[*it];
}

// list words with counters by order of appearance
-<a name="boost_bimap8co" href="controlling_collection_types.html#boost_bimap8"><img src="../../images/callouts/3.png" alt="3" border="0"></a>for( word_counter::right_const_iterator
+<a class="co" name="boost_bimap8co" href="controlling_collection_types.html#boost_bimap8"><img src="../../../../../../doc/src/images/callouts/3.png" alt="3" border="0"></a>for( word_counter::right_const_iterator
 wit = wc.right.begin(), wit_end = wc.right.end();

 wit != wit_end; ++wit )
@@ -525,22 +512,19 @@
 
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
-<td width="5%" valign="top" align="left">
-<a name="boost_bimap6"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap6"></a> </td>
<td valign="top" align="left"> <code class="computeroutput">counter</code> is an integer
 that is initialized in zero in the constructor </td>
</tr>
<tr>
-<td width="5%" valign="top" align="left">
-<a name="boost_bimap7"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap7"></a> </td>
<td valign="top" align="left"> Because the right collection
 type is <code class="computeroutput">list_of</code>, the
 right data is not used a key and can be modified in the same way as with
 standard maps. </td>
</tr>
<tr>
-<td width="5%" valign="top" align="left">
-<a name="boost_bimap8"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap8"></a> </td>
<td valign="top" align="left"> When we insert the elements using the left map view, the
 element is inserted at the end of the list. </td>
</tr>

Modified: trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/differences_with_standard_maps.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/differences_with_standard_maps.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/differences_with_standard_maps.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -1,33 +1,30 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Differences
- with standard maps</title>
+<title>Differences with standard maps</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../the_tutorial.html" title="The tutorial">
-<link rel="prev" href="the_collection_of_relations_type.html" title="The
- collection of relations type">
+<link rel="prev" href="the_collection_of_relations_type.html" title="The collection of relations type">
<link rel="next" href="useful_functions.html" title="Useful functions">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="the_collection_of_relations_type.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="useful_functions.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="Differences with standard maps">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.the_tutorial.differences_with_standard_maps"></a><a href="differences_with_standard_maps.html" title="Differences
- with standard maps">Differences
+<a name="boost_bimap.the_tutorial.differences_with_standard_maps"></a><a class="link" href="differences_with_standard_maps.html" title="Differences with standard maps">Differences
 with standard maps</a>
</h3></div></div></div>
<div class="toc"><dl>
@@ -38,9 +35,9 @@
<dt><a href="differences_with_standard_maps.html#boost_bimap.the_tutorial.differences_with_standard_maps.complexity_of_operations">Complexity
 of operations</a></dt>
</dl></div>
-<div class="section" lang="en">
+<div class="section" title="Insertion">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.the_tutorial.differences_with_standard_maps.insertion"></a>Insertion
+<a name="boost_bimap.the_tutorial.differences_with_standard_maps.insertion"></a><a class="link" href="differences_with_standard_maps.html#boost_bimap.the_tutorial.differences_with_standard_maps.insertion" title="Insertion">Insertion</a>
</h4></div></div></div>

 Remember that a map can be interpreted as a relation between two collections.
@@ -48,8 +45,7 @@
 constrains in each of them. Some insertions that we give for granted to
 success in standard maps fails with bimaps. For example:
 
-<pre class="programlisting">
-bimap<int,std::string> bm;
+<pre class="programlisting">bimap<int,std::string> bm;

bm.left.insert(1,"orange");
bm.left.insert(2,"orange"); // No effect! returns make_pair(iter,false)
@@ -61,8 +57,7 @@
 values are different and it is allowed by the right map view because it
 is a non-unique collection type.
 
-<pre class="programlisting">
-bimap<int, multiset_of<std::string> > bm;
+<pre class="programlisting">bimap<int, multiset_of<std::string> > bm;

bm.left.insert(1,"orange");
bm.left.insert(2,"orange"); // Insertion succeed!
@@ -72,9 +67,9 @@
 allowed by it too.
 
</div>
-<div class="section" lang="en">
+<div class="section" title="iterator::value_type">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.the_tutorial.differences_with_standard_maps.iterator__value_type"></a>iterator::value_type
+<a name="boost_bimap.the_tutorial.differences_with_standard_maps.iterator__value_type"></a><a class="link" href="differences_with_standard_maps.html#boost_bimap.the_tutorial.differences_with_standard_maps.iterator__value_type" title="iterator::value_type">iterator::value_type</a>
</h4></div></div></div>

 The relations stored in the Bimap will not be in most cases modifiable
@@ -86,8 +81,7 @@
 is no problem with modifying the data of that side. The following code
 is valid:
 
-<pre class="programlisting">
-typedef bimap< int, list_of< std::string > > bm_type;
+<pre class="programlisting">typedef bimap< int, list_of< std::string > > bm_type;
bm_type bm;
bm.insert( bm_type::relation( 1, "one" ) );
...
@@ -346,10 +340,9 @@
</tbody>
</table></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="operator[] and at()">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.the_tutorial.differences_with_standard_maps.operator_____and_at__"></a><a href="differences_with_standard_maps.html#boost_bimap.the_tutorial.differences_with_standard_maps.operator_____and_at__" title="operator[]
- and at()">operator[]
+<a name="boost_bimap.the_tutorial.differences_with_standard_maps.operator_____and_at__"></a><a class="link" href="differences_with_standard_maps.html#boost_bimap.the_tutorial.differences_with_standard_maps.operator_____and_at__" title="operator[] and at()">operator[]
 and at()</a>
</h4></div></div></div>

@@ -358,8 +351,7 @@
 to retrieve the associated data of a given key only when the other collection
 type is a mutable one. In these cases it works in the same way as the standard.
 
-<pre class="programlisting">
-bimap< unorderd_set_of< std::string>, list_of<int> > bm;
+<pre class="programlisting">bimap< unorderd_set_of< std::string>, list_of<int> > bm;

bm.left["one"] = 1; // Ok
</pre>
@@ -367,8 +359,7 @@
 The standard defines an access function for <code class="computeroutput">map</code>
 and <code class="computeroutput">unordered_map</code>:
 
-<pre class="programlisting">
-const data_type & at(const key_type & k) const;
+<pre class="programlisting">const data_type & at(const key_type & k) const;
 data_type & at(const key_type & k);
</pre>

@@ -392,8 +383,7 @@



-<pre class="programlisting">
-typedef bimap< set_of< std::string >, list_of< int > > bm_type;
+<pre class="programlisting">typedef bimap< set_of< std::string >, list_of< int > > bm_type;
bm_type bm;

try
@@ -417,8 +407,7 @@



-<pre class="programlisting">
-typedef bimap< multiset_of<std::string>, unordered_set_of<int> > bm_type;
+<pre class="programlisting">typedef bimap< multiset_of<std::string>, unordered_set_of<int> > bm_type;
bm_type bm;

bm.right[1] = "one"; // compilation error
@@ -441,14 +430,13 @@

 
</div>
-<div class="section" lang="en">
+<div class="section" title="Complexity of operations">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.the_tutorial.differences_with_standard_maps.complexity_of_operations"></a><a href="differences_with_standard_maps.html#boost_bimap.the_tutorial.differences_with_standard_maps.complexity_of_operations" title="Complexity
- of operations">Complexity
+<a name="boost_bimap.the_tutorial.differences_with_standard_maps.complexity_of_operations"></a><a class="link" href="differences_with_standard_maps.html#boost_bimap.the_tutorial.differences_with_standard_maps.complexity_of_operations" title="Complexity of operations">Complexity
 of operations</a>
</h4></div></div></div>

- The complexity of some operations is different in bimaps. Read <a href="../reference/bimap_reference.html#complexity_signature_explanation">the
+ The complexity of some operations is different in bimaps. Read <a class="link" href="../reference/bimap_reference.html#complexity_signature_explanation">the
 reference</a> to find the complexity of each function.
 
</div>

Modified: trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/discovering_the_bimap_framework.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/discovering_the_bimap_framework.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/discovering_the_bimap_framework.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -1,33 +1,30 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Discovering
- the bimap framework</title>
+<title>Discovering the bimap framework</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../the_tutorial.html" title="The tutorial">
<link rel="prev" href="../the_tutorial.html" title="The tutorial">
-<link rel="next" href="controlling_collection_types.html" title="Controlling
- collection types">
+<link rel="next" href="controlling_collection_types.html" title="Controlling collection types">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="controlling_collection_types.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="Discovering the bimap framework">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.the_tutorial.discovering_the_bimap_framework"></a><a href="discovering_the_bimap_framework.html" title="Discovering
- the bimap framework">Discovering
+<a name="boost_bimap.the_tutorial.discovering_the_bimap_framework"></a><a class="link" href="discovering_the_bimap_framework.html" title="Discovering the bimap framework">Discovering
 the bimap framework</a>
</h3></div></div></div>
<div class="toc"><dl>
@@ -38,10 +35,9 @@
<dt><a href="discovering_the_bimap_framework.html#boost_bimap.the_tutorial.discovering_the_bimap_framework.bimap_mapping_framework">Bimap
 mapping framework</a></dt>
</dl></div>
-<div class="section" lang="en">
+<div class="section" title="Interpreting bidirectional maps">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.the_tutorial.discovering_the_bimap_framework.interpreting_bidirectional_maps"></a><a href="discovering_the_bimap_framework.html#boost_bimap.the_tutorial.discovering_the_bimap_framework.interpreting_bidirectional_maps" title="Interpreting
- bidirectional maps">Interpreting
+<a name="boost_bimap.the_tutorial.discovering_the_bimap_framework.interpreting_bidirectional_maps"></a><a class="link" href="discovering_the_bimap_framework.html#boost_bimap.the_tutorial.discovering_the_bimap_framework.interpreting_bidirectional_maps" title="Interpreting bidirectional maps">Interpreting
 bidirectional maps</a>
</h4></div></div></div>

@@ -55,10 +51,9 @@
 and data from the left collection.
 
</div>
-<div class="section" lang="en">
+<div class="section" title="Standard mapping framework">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.the_tutorial.discovering_the_bimap_framework.standard_mapping_framework"></a><a href="discovering_the_bimap_framework.html#boost_bimap.the_tutorial.discovering_the_bimap_framework.standard_mapping_framework" title="Standard
- mapping framework">Standard
+<a name="boost_bimap.the_tutorial.discovering_the_bimap_framework.standard_mapping_framework"></a><a class="link" href="discovering_the_bimap_framework.html#boost_bimap.the_tutorial.discovering_the_bimap_framework.standard_mapping_framework" title="Standard mapping framework">Standard
 mapping framework</a>
</h4></div></div></div>

@@ -78,7 +73,7 @@
 containers.
 
<div class="table">
-<a name="id2619834"></a>Table 1.1. std associative containers
+<a name="id559754"></a>Table 1.1. std associative containers
<div class="table-contents"><table class="table" summary="std associative containers">
<colgroup>
<col>
@@ -176,10 +171,9 @@
</div>
 
</div>
-<div class="section" lang="en">
+<div class="section" title="Bimap mapping framework">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.the_tutorial.discovering_the_bimap_framework.bimap_mapping_framework"></a><a href="discovering_the_bimap_framework.html#boost_bimap.the_tutorial.discovering_the_bimap_framework.bimap_mapping_framework" title="Bimap
- mapping framework">Bimap
+<a name="boost_bimap.the_tutorial.discovering_the_bimap_framework.bimap_mapping_framework"></a><a class="link" href="discovering_the_bimap_framework.html#boost_bimap.the_tutorial.discovering_the_bimap_framework.bimap_mapping_framework" title="Bimap mapping framework">Bimap
 mapping framework</a>
</h4></div></div></div>

@@ -221,7 +215,7 @@
 The following code snippet shows the relation between a bimap and standard
 maps.
 
-<div class="note"><table border="0" summary="Note">
+<div class="note" title="Note"><table border="0" summary="Note">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/html/images/note.png"></td>
<th align="left">Note</th>
@@ -232,8 +226,7 @@
 Views cannot be constructed as separate objects from the container they
 belong to, so the following:

-<pre class="programlisting">
-// Wrong: we forgot the & after bm_type::left_type
+<pre class="programlisting">// Wrong: we forgot the & after bm_type::left_type
bm_type::left_map lm = bm.left;
</pre>

@@ -250,8 +243,7 @@



-<pre class="programlisting">
-template< class Map, class CompatibleKey, class CompatibleData >
+<pre class="programlisting">template< class Map, class CompatibleKey, class CompatibleData >
void use_it( Map & m,
 const CompatibleKey & key,
 const CompatibleData & data )

Modified: trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/the_collection_of_relations_type.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/the_collection_of_relations_type.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/the_collection_of_relations_type.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -1,34 +1,30 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>The
- collection of relations type</title>
+<title>The collection of relations type</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../the_tutorial.html" title="The tutorial">
-<link rel="prev" href="controlling_collection_types.html" title="Controlling
- collection types">
-<link rel="next" href="differences_with_standard_maps.html" title="Differences
- with standard maps">
+<link rel="prev" href="controlling_collection_types.html" title="Controlling collection types">
+<link rel="next" href="differences_with_standard_maps.html" title="Differences with standard maps">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="controlling_collection_types.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="differences_with_standard_maps.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="The collection of relations type">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.the_tutorial.the_collection_of_relations_type"></a><a href="the_collection_of_relations_type.html" title="The
- collection of relations type">The
+<a name="boost_bimap.the_tutorial.the_collection_of_relations_type"></a><a class="link" href="the_collection_of_relations_type.html" title="The collection of relations type">The
 collection of relations type</a>
</h3></div></div></div>
<div class="toc"><dl>
@@ -38,10 +34,9 @@
 parameters</a></dt>
<dt>Examples</dt>
</dl></div>
-<div class="section" lang="en">
+<div class="section" title="A new point of view">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.the_tutorial.the_collection_of_relations_type.a_new_point_of_view"></a><a href="the_collection_of_relations_type.html#boost_bimap.the_tutorial.the_collection_of_relations_type.a_new_point_of_view" title="A
- new point of view">A
+<a name="boost_bimap.the_tutorial.the_collection_of_relations_type.a_new_point_of_view"></a><a class="link" href="the_collection_of_relations_type.html#boost_bimap.the_tutorial.the_collection_of_relations_type.a_new_point_of_view" title="A new point of view">A
 new point of view</a>
</h4></div></div></div>

@@ -65,36 +60,36 @@
 times where it is useful to give this collection other constraints or simply
 to order it differently. The user is allowed to choose between:
 
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 left_based
 </li>
-<li>
+<li class="listitem">
 right_based
 </li>
-<li>
+<li class="listitem">
 set_of_relation<>
 </li>
-<li>
+<li class="listitem">
 multiset_of_relation<>
 </li>
-<li>
+<li class="listitem">
 unordered_set_of_relation<>
 </li>
-<li>
+<li class="listitem">
 unordered_multiset_of_relation<>
 </li>
-<li>
+<li class="listitem">
 list_of_relation
 </li>
-<li>
+<li class="listitem">
 vector_of_relation
 </li>
-<li>
+<li class="listitem">
 unconstrained_set_of_relation
 </li>
</ul></div>
-<div class="tip"><table border="0" summary="Tip">
+<div class="tip" title="Tip"><table border="0" summary="Tip">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Tip]" src="../../../../../../doc/html/images/tip.png"></td>
<th align="left">Tip</th>
@@ -127,8 +122,7 @@



-<pre class="programlisting">
-#include <iostream>
+<pre class="programlisting">#include <iostream>
#include <string>
#include <boost/bimap/bimap.hpp>
#include <boost/bimap/list_of.hpp>
@@ -215,10 +209,9 @@

 
</div>
-<div class="section" lang="en">
+<div class="section" title="Configuration parameters">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.the_tutorial.the_collection_of_relations_type.configuration_parameters"></a><a href="the_collection_of_relations_type.html#boost_bimap.the_tutorial.the_collection_of_relations_type.configuration_parameters" title="Configuration
- parameters">Configuration
+<a name="boost_bimap.the_tutorial.the_collection_of_relations_type.configuration_parameters"></a><a class="link" href="the_collection_of_relations_type.html#boost_bimap.the_tutorial.the_collection_of_relations_type.configuration_parameters" title="Configuration parameters">Configuration
 parameters</a>
</h4></div></div></div>

@@ -355,15 +348,14 @@
</tbody>
</table></div>
</div>
-<div class="section" lang="en">
+<div class="section" title="Examples">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.the_tutorial.the_collection_of_relations_type.examples"></a>Examples
+<a name="boost_bimap.the_tutorial.the_collection_of_relations_type.examples"></a><a class="link" href="the_collection_of_relations_type.html#boost_bimap.the_tutorial.the_collection_of_relations_type.examples" title="Examples">Examples</a>
</h4></div></div></div>

 Consider this example:
 
-<pre class="programlisting">
-template< class Rel >
+<pre class="programlisting">template< class Rel >
struct RelOrder
{
 bool operator()(Rel ra, Rel rb) const
@@ -385,8 +377,7 @@
 This container will only allow unique relations because <code class="computeroutput">set_of_relation</code>
 has been used but the elements in each side of the bimap can be repeated.
 
-<pre class="programlisting">
-struct name {};
+<pre class="programlisting">struct name {};
struct phone_number {};

typedef bimap

Modified: trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/unconstrained_sets.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/unconstrained_sets.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/unconstrained_sets.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -1,34 +1,30 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Unconstrained
- Sets</title>
+<title>Unconstrained Sets</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../the_tutorial.html" title="The tutorial">
-<link rel="prev" href="bimaps_with_user_defined_names.html" title="Bimaps
- with user defined names">
-<link rel="next" href="additional_information.html" title="Additional
- information">
+<link rel="prev" href="bimaps_with_user_defined_names.html" title="Bimaps with user defined names">
+<link rel="next" href="additional_information.html" title="Additional information">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="bimaps_with_user_defined_names.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="additional_information.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="Unconstrained Sets">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.the_tutorial.unconstrained_sets"></a><a href="unconstrained_sets.html" title="Unconstrained
- Sets">Unconstrained
+<a name="boost_bimap.the_tutorial.unconstrained_sets"></a><a class="link" href="unconstrained_sets.html" title="Unconstrained Sets">Unconstrained
 Sets</a>
</h3></div></div></div>

@@ -40,16 +36,16 @@

 Unconstrained sets are useful for the following reasons:
 
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 A bimap type has stronger guarantees than its standard equivalent, and
 includes some useful functions (replace, modify) that the standard does
 not have.
 </li>
-<li>
+<li class="listitem">
 You can view the mapping as a collection of relations.
 </li>
-<li>
+<li class="listitem">
 Using this kind of map makes the code very extensible. If, at any moment
 of the development, the need to perform searches from the right side of
 the mapping arises, the only necessary change is to the <code class="computeroutput">typedef</code>.
@@ -63,8 +59,7 @@



-<pre class="programlisting">
-typedef bimap< std::string, unconstrained_set_of<int> > bm_type;
+<pre class="programlisting">typedef bimap< std::string, unconstrained_set_of<int> > bm_type;
typedef bm_type::left_map map_type;

bm_type bm;
@@ -82,8 +77,7 @@



-<pre class="programlisting">
-typedef std::map< std::string, int > map_type;
+<pre class="programlisting">typedef std::map< std::string, int > map_type;

map_type m;
</pre>
@@ -99,14 +93,13 @@



-<pre class="programlisting">
-m["one"] = 1;
+<pre class="programlisting">m["one"] = 1;

assert( m.find("one") != m.end() );

for( map_type::iterator i = m.begin(), iend = m.end(); i != iend; ++i )
{
- <a name="boost_bimap14co" href="unconstrained_sets.html#boost_bimap14"><img src="../../images/callouts/1.png" alt="1" border="0"></a>++(i->second);
+ <a class="co" name="boost_bimap14co" href="unconstrained_sets.html#boost_bimap14"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>++(i->second);
}

m.erase("one");
@@ -118,8 +111,7 @@

 
<div class="calloutlist"><table border="0" summary="Callout list"><tr>
-<td width="5%" valign="top" align="left">
-<a name="boost_bimap14"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap14"></a> </td>
<td valign="top" align="left"> The right collection of the bimap is mutable so its elements can be modified
 using iterators. </td>
</tr></table></div>
@@ -135,11 +127,10 @@



-<pre class="programlisting">
-typedef map_type::const_iterator const_iterator;
+<pre class="programlisting">typedef map_type::const_iterator const_iterator;
typedef std::pair<const_iterator,const_iterator> const_range;

-<a name="boost_bimap15co" href="unconstrained_sets.html#boost_bimap15"><img src="../../images/callouts/1.png" alt="1" border="0"></a>const_range r = m.range( "one" <= _key, _key <= "two" );
+<a class="co" name="boost_bimap15co" href="unconstrained_sets.html#boost_bimap15"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>const_range r = m.range( "one" <= _key, _key <= "two" );
for( const_iterator i = r.first; i != r.second; ++i )
{
 std::cout << i->first << "-->" << i->second << std::endl;
@@ -154,8 +145,7 @@

 
<div class="calloutlist"><table border="0" summary="Callout list"><tr>
-<td width="5%" valign="top" align="left">
-<a name="boost_bimap15"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap15"></a> </td>
<td valign="top" align="left"> This range is a model of BidirectionalRange, read the docs of Boost.Range
 for more information. </td>
</tr></table></div>

Modified: trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/useful_functions.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/useful_functions.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/useful_functions.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -3,30 +3,28 @@
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>Useful functions</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../the_tutorial.html" title="The tutorial">
-<link rel="prev" href="differences_with_standard_maps.html" title="Differences
- with standard maps">
-<link rel="next" href="bimaps_with_user_defined_names.html" title="Bimaps
- with user defined names">
+<link rel="prev" href="differences_with_standard_maps.html" title="Differences with standard maps">
+<link rel="next" href="bimaps_with_user_defined_names.html" title="Bimaps with user defined names">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="differences_with_standard_maps.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="bimaps_with_user_defined_names.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section" title="Useful functions">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.the_tutorial.useful_functions"></a>Useful functions
+<a name="boost_bimap.the_tutorial.useful_functions"></a><a class="link" href="useful_functions.html" title="Useful functions">Useful functions</a>
</h3></div></div></div>
<div class="toc"><dl>
<dt><a href="useful_functions.html#boost_bimap.the_tutorial.useful_functions.projection_of_iterators">Projection
@@ -36,10 +34,9 @@
<dt><a href="useful_functions.html#boost_bimap.the_tutorial.useful_functions.retrieval_of_ranges">Retrieval
 of ranges</a></dt>
</dl></div>
-<div class="section" lang="en">
+<div class="section" title="Projection of iterators">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.the_tutorial.useful_functions.projection_of_iterators"></a><a href="useful_functions.html#boost_bimap.the_tutorial.useful_functions.projection_of_iterators" title="Projection
- of iterators">Projection
+<a name="boost_bimap.the_tutorial.useful_functions.projection_of_iterators"></a><a class="link" href="useful_functions.html#boost_bimap.the_tutorial.useful_functions.projection_of_iterators" title="Projection of iterators">Projection
 of iterators</a>
</h4></div></div></div>

@@ -62,8 +59,7 @@



-<pre class="programlisting">
-typedef bimap<std::string,multiset_of<int,std::greater<int> > > bm_type;
+<pre class="programlisting">typedef bimap<std::string,multiset_of<int,std::greater<int> > > bm_type;

bm_type bm;
bm.insert( bm_type::value_type("John" ,34) );
@@ -85,10 +81,9 @@

 
</div>
-<div class="section" lang="en">
+<div class="section" title="replace and modify">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.the_tutorial.useful_functions.replace_and_modify"></a><a href="useful_functions.html#boost_bimap.the_tutorial.useful_functions.replace_and_modify" title="replace
- and modify">replace
+<a name="boost_bimap.the_tutorial.useful_functions.replace_and_modify"></a><a class="link" href="useful_functions.html#boost_bimap.the_tutorial.useful_functions.replace_and_modify" title="replace and modify">replace
 and modify</a>
</h4></div></div></div>

@@ -109,8 +104,7 @@



-<pre class="programlisting">
-typedef bimap< int, std::string > bm_type;
+<pre class="programlisting">typedef bimap< int, std::string > bm_type;
bm_type bm;

bm.insert( bm_type::value_type(1,"one") );
@@ -134,7 +128,7 @@

 bool successful_replace = bm.left.replace_data( it, "two" );

- <a name="boost_bimap9co" href="useful_functions.html#boost_bimap9"><img src="../../images/callouts/1.png" alt="1" border="0"></a>assert( ! successful_replace );
+ <a class="co" name="boost_bimap9co" href="useful_functions.html#boost_bimap9"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>assert( ! successful_replace );
 assert( bm.size() == 2 );
}
</pre>
@@ -145,8 +139,7 @@

 
<div class="calloutlist"><table border="0" summary="Callout list"><tr>
-<td width="5%" valign="top" align="left">
-<a name="boost_bimap9"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap9"></a> </td>
<td valign="top" align="left"> <code class="computeroutput">it</code> is still valid here,
 and the bimap was left unchanged </td>
</tr></table></div>
@@ -158,15 +151,15 @@
 <code class="computeroutput">replace</code> functions performs
 this substitution in such a manner that:
 
-<div class="itemizedlist"><ul type="disc">
-<li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
 The complexity is constant time if the changed element retains its original
 order with respect to all views; it is logarithmic otherwise.
 </li>
-<li>
+<li class="listitem">
 Iterator and reference validity are preserved.
 </li>
-<li>
+<li class="listitem">
 The operation is strongly exception-safe, i.e. the <code class="computeroutput">bimap</code>
 remains unchanged if some exception (originated by the system or the
 user's data types) is thrown.
@@ -220,8 +213,7 @@



-<pre class="programlisting">
-typedef bimap< int, std::string > bm_type;
+<pre class="programlisting">typedef bimap< int, std::string > bm_type;
bm_type bm;
bm.insert( bm_type::value_type(1,"one") );

@@ -244,7 +236,7 @@

 bool successful_modify = bm.left.modify_data( it, _data = "two" );

- <a name="boost_bimap10co" href="useful_functions.html#boost_bimap10"><img src="../../images/callouts/1.png" alt="1" border="0"></a>assert( ! successful_modify );
+ <a class="co" name="boost_bimap10co" href="useful_functions.html#boost_bimap10"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>assert( ! successful_modify );
 assert( bm.size() == 1 );
}
</pre>
@@ -255,8 +247,7 @@

 
<div class="calloutlist"><table border="0" summary="Callout list"><tr>
-<td width="5%" valign="top" align="left">
-<a name="boost_bimap10"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap10"></a> </td>
<td valign="top" align="left"> <code class="computeroutput">it</code> is not longer valid
 and <code class="computeroutput">(1,"1")</code> is removed from the bimap </td>
</tr></table></div>
@@ -265,10 +256,9 @@

 
</div>
-<div class="section" lang="en">
+<div class="section" title="Retrieval of ranges">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.the_tutorial.useful_functions.retrieval_of_ranges"></a><a href="useful_functions.html#boost_bimap.the_tutorial.useful_functions.retrieval_of_ranges" title="Retrieval
- of ranges">Retrieval
+<a name="boost_bimap.the_tutorial.useful_functions.retrieval_of_ranges"></a><a class="link" href="useful_functions.html#boost_bimap.the_tutorial.useful_functions.retrieval_of_ranges" title="Retrieval of ranges">Retrieval
 of ranges</a>
</h4></div></div></div>

@@ -285,8 +275,7 @@



-<pre class="programlisting">
-typedef bimap<int,std::string> bm_type;
+<pre class="programlisting">typedef bimap<int,std::string> bm_type;
bm_type bm;

// ...
@@ -310,8 +299,7 @@



-<pre class="programlisting">
-bm_type::left_iterator iter_first = bm.left.upper_bound(20);
+<pre class="programlisting">bm_type::left_iterator iter_first = bm.left.upper_bound(20);
bm_type::left_iterator iter_second = bm.left.lower_bound(50);

// range [iter_first,iter_second) contains the elements in (20,50)
@@ -338,15 +326,14 @@



-<pre class="programlisting">
-typedef bimap<int,std::string> bm_type;
+<pre class="programlisting">typedef bimap<int,std::string> bm_type;
bm_type bm;

// ...

-<a name="boost_bimap11co" href="useful_functions.html#boost_bimap11"><img src="../../images/callouts/1.png" alt="1" border="0"></a>bm_type::left_range_type r;
+<a class="co" name="boost_bimap11co" href="useful_functions.html#boost_bimap11"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>bm_type::left_range_type r;

-<a name="boost_bimap12co" href="useful_functions.html#boost_bimap12"><img src="../../images/callouts/2.png" alt="2" border="0"></a>r = bm.left.range( 20 <= _key, _key <= 50 ); // [20,50]
+<a class="co" name="boost_bimap12co" href="useful_functions.html#boost_bimap12"><img src="../../../../../../doc/src/images/callouts/2.png" alt="2" border="0"></a>r = bm.left.range( 20 <= _key, _key <= 50 ); // [20,50]

r = bm.left.range( 20 < _key, _key < 50 ); // (20,50)

@@ -360,15 +347,13 @@
 
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
-<td width="5%" valign="top" align="left">
-<a name="boost_bimap11"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap11"></a> </td>
<td valign="top" align="left"> <code class="computeroutput">range_type</code> is a handy
 typedef equal to <code class="computeroutput">std::pair<iterator,iterator></code>. <code class="computeroutput">const_range_type</code>
 is provided too, and it is equal to <code class="computeroutput">std::pair<const_iterator,const_iterator></code> </td>
</tr>
<tr>
-<td width="5%" valign="top" align="left">
-<a name="boost_bimap12"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap12"></a> </td>
<td valign="top" align="left"> _key is a Boost.Lambda placeholder.
 To use it you have to include <code class="computeroutput"><boost/bimap/support/lambda.hpp></code>
 </td>
@@ -392,12 +377,11 @@



-<pre class="programlisting">
-r = bm.left.range( 20 <= _key, unbounded ); // [20,inf)
+<pre class="programlisting">r = bm.left.range( 20 <= _key, unbounded ); // [20,inf)

r = bm.left.range( unbounded , _key < 50 ); // (-inf,50)

-<a name="boost_bimap13co" href="useful_functions.html#boost_bimap13"><img src="../../images/callouts/1.png" alt="1" border="0"></a>r = bm.left.range( unbounded , unbounded ); // (-inf,inf)
+<a class="co" name="boost_bimap13co" href="useful_functions.html#boost_bimap13"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>r = bm.left.range( unbounded , unbounded ); // (-inf,inf)
</pre>

 
@@ -406,8 +390,7 @@

 
<div class="calloutlist"><table border="0" summary="Callout list"><tr>
-<td width="5%" valign="top" align="left">
-<a name="boost_bimap13"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap13"></a> </td>
<td valign="top" align="left"> This is equivalent to std::make_pair(s.begin(),s.end()) </td>
</tr></table></div>

Modified: trunk/libs/bimap/doc/html/index.html
==============================================================================
--- trunk/libs/bimap/doc/html/index.html (original)
+++ trunk/libs/bimap/doc/html/index.html 2009-11-20 04:47:30 EST (Fri, 20 Nov 2009)
@@ -3,22 +3,22 @@
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>Chapter 1. Boost.Bimap</title>
<link rel="stylesheet" href="boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.70.1">
-<link rel="start" href="index.html" title="Chapter 1. Boost.Bimap">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="index.html" title="Chapter 1. Boost.Bimap">
<link rel="next" href="boost_bimap/introduction.html" title="Introduction">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td>
-<td align="center">Home</td>
+<td align="center">Home</td>
<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav"><a accesskey="n" href="boost_bimap/introduction.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a></div>
-<div class="chapter" lang="en">
+<div class="chapter" title="Chapter 1. Boost.Bimap">
<div class="titlepage"><div>
<div><h2 class="title">
<a name="bimap"></a>Chapter 1. Boost.Bimap</h2></div>
@@ -26,8 +26,8 @@
Matias Capeletto
</h3></div></div>
<div>Copyright © 2006 -2007 Matias Capeletto</div>
-<div><div class="legalnotice">
-<a name="id2604940"></a>
+<div><div class="legalnotice" title="Legal Notice">
+<a name="id553942"></a>
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -115,13 +115,13 @@
<dt>Acknowledgements</dt>
</dl>
</div>
-<div class="section" lang="en">
+<div class="section" title="Preface">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="bimap.preface"></a>Preface
+<a name="bimap.preface"></a><a class="link" href="index.html#bimap.preface" title="Preface">Preface</a>
</h2></div></div></div>
<a name="bimap.preface.description"></a><h4>
-<a name="id2604978"></a>
- Description
+<a name="id553973"></a>
+ <a class="link" href="index.html#bimap.preface.description">Description</a>
 </h4>

 <img src="images/bimap/boost.bimap.logo.png" alt="boost.bimap.logo">
@@ -137,8 +137,8 @@
 containers.
 
<a name="bimap.preface.influences_and_related_work"></a><h4>
-<a name="id2568656"></a>
- <a href="index.html#bimap.preface.influences_and_related_work">Influences and Related
+<a name="id554118"></a>
+ <a class="link" href="index.html#bimap.preface.influences_and_related_work">Influences and Related
 Work</a>
 </h4>

@@ -149,7 +149,7 @@
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left">Last revised: February 14, 2008 at 19:01:52 GMT</td>
+<td align="left">Last revised: November 20, 2009 at 09:43:59 GMT</td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>

Next message: s.ochsenknecht_at_[hidden]: "[Boost-commit] svn:boost r57805 - in trunk/libs/program_options: src test"
Previous message: daniel_james_at_[hidden]: "[Boost-commit] svn:boost r57803 - in branches/release/boost/bimap: . detail"

Date view	Thread view	Subject view	Author view

Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk