Boost-Commit :

Date view	Thread view	Subject view	Author view

Subject: [Boost-commit] svn:boost r64169 - 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: 2010-07-19 16:17:26

Next message: daniel_james_at_[hidden]: "[Boost-commit] svn:boost r64170 - in trunk/libs: numeric/conversion/doc optional/doc"
Previous message: daniel_james_at_[hidden]: "[Boost-commit] svn:boost r64172 - trunk/libs/property_map/doc"

Author: danieljames
Date: 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
New Revision: 64169
URL: http://svn.boost.org/trac/boost/changeset/64169

Log:
Rebuild bimap documentation.
Text files modified:
   trunk/libs/bimap/doc/html/boost_bimap/acknowledgements.html | 20
   trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost.html | 77 -
   trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html | 400 +++----
   trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost/dependencies.html | 569 ++++++------
   trunk/libs/bimap/doc/html/boost_bimap/compiler_specifics.html | 326 +++---
   trunk/libs/bimap/doc/html/boost_bimap/examples.html | 511 +++++-----
   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 | 52
   trunk/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___hashed_indices.html | 30
   trunk/libs/bimap/doc/html/boost_bimap/examples/simple_bimap.html | 47
   trunk/libs/bimap/doc/html/boost_bimap/future_work.html | 18
   trunk/libs/bimap/doc/html/boost_bimap/history.html | 100 +-
   trunk/libs/bimap/doc/html/boost_bimap/history/multiindex_and_bimap.html | 670 ++++---------
   trunk/libs/bimap/doc/html/boost_bimap/introduction.html | 171 +-
   trunk/libs/bimap/doc/html/boost_bimap/one_minute_tutorial.html | 126 +-
   trunk/libs/bimap/doc/html/boost_bimap/performance.html | 16
   trunk/libs/bimap/doc/html/boost_bimap/rationale.html | 48
   trunk/libs/bimap/doc/html/boost_bimap/rationale/additional_features.html | 66
   trunk/libs/bimap/doc/html/boost_bimap/rationale/code.html | 184 +--
   trunk/libs/bimap/doc/html/boost_bimap/rationale/the_student_and_the_mentor.html | 1851 +++++++++++++--------------------------
   trunk/libs/bimap/doc/html/boost_bimap/reference.html | 70
   trunk/libs/bimap/doc/html/boost_bimap/reference/bimap_reference.html | 741 +++++++--------
   trunk/libs/bimap/doc/html/boost_bimap/reference/list_of_reference.html | 1328 +++++++++++++--------------
   trunk/libs/bimap/doc/html/boost_bimap/reference/set_of_reference.html | 1156 ++++++++++++------------
   trunk/libs/bimap/doc/html/boost_bimap/reference/unconstrained_set_of_reference.html | 60
   trunk/libs/bimap/doc/html/boost_bimap/reference/unordered_set_of_reference.html | 1112 +++++++++++------------
   trunk/libs/bimap/doc/html/boost_bimap/reference/vector_of_reference.html | 1374 ++++++++++++++---------------
   trunk/libs/bimap/doc/html/boost_bimap/release_notes.html | 16
   trunk/libs/bimap/doc/html/boost_bimap/test_suite.html | 447 ++++----
   trunk/libs/bimap/doc/html/boost_bimap/the_tutorial.html | 120 +-
   trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/additional_information.html | 54
   trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/bimaps_with_user_defined_names.html | 268 ++--
   trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/complete_instantiation_scheme.html | 159 +-
   trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/controlling_collection_types.html | 385 ++++----
   trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/differences_with_standard_maps.html | 366 +++----
   trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/discovering_the_bimap_framework.html | 168 +-
   trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/the_collection_of_relations_type.html | 194 ++--
   trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/unconstrained_sets.html | 74 -
   trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/useful_functions.html | 121 -
   trunk/libs/bimap/doc/html/index.html | 32
   40 files changed, 6109 insertions(+), 7438 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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,27 +1,27 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Acknowledgements</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<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="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">
</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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="history/multiindex_and_bimap.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a>
</div>
-<div class="section" title="Acknowledgements">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="boost_bimap.acknowledgements"></a><a class="link" href="acknowledgements.html" title="Acknowledgements">Acknowledgements</a>
</h2></div></div></div>
@@ -68,10 +68,10 @@
 Thanks to Alisdair Meredith, Fernando Cacciola, Jeff Garland, John Maddock,
 Thorsten Ottosen, Tony and Giovanni Piero Deretta for participating in the
 formal review and give me useful advices to improve this library. And thanks
- a lot to Ion Gaztañaga for managing the review.
+ a lot to Ion Gaztañaga for managing the review.
 
<a name="boost_bimap.acknowledgements.boost_bimap_team"></a><h4>
-<a name="id672804"></a>
+<a name="id880239"></a>
 <a class="link" href="acknowledgements.html#boost_bimap.acknowledgements.boost_bimap_team">Boost.Bimap Team</a>
 </h4>

@@ -86,7 +86,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -94,7 +94,7 @@
</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>
+<a accesskey="p" href="history/multiindex_and_bimap.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Bimap and Boost</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<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="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">
</head>
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="the_tutorial/complete_instantiation_scheme.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Bimap and Boost">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<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>
@@ -45,7 +45,7 @@
</dl></dd>
<dt>Dependencies</dt>
</dl></div>
-<div class="section" title="Bimap and MultiIndex">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<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>
@@ -54,36 +54,18 @@
 MISC - Multi-Index Specialized
 Containers
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Let's be generic, construct frameworks, describe the world
- in an unified way... 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- No!, it is better to be specialized, design easy-to-use components,
- offer plug-and-play objects... 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Why not take advantage of the best of both worlds?
- 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Let's be generic, construct frameworks, describe the world in
+ an unified way... 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ No!, it is better to be specialized, design easy-to-use components,
+ offer plug-and-play objects... 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Why not take advantage of the best of both worlds?
+ 
+ </blockquote></div>

 <img src="../images/bimap/miBimapFramework.png" alt="miBimapFramework">
 
@@ -100,9 +82,7 @@
 the best for every specialization. People may end up wrapping a B.MI container
 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="id583056" href="#ftn.id583056" class="footnote">2</a>]
- . There is no learning curve if you know how to use standard containers.
+ maps [<a name="id789018" href="#ftn.id789018" 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.
 
@@ -126,8 +106,6 @@
 This type of problem is better modelled as a database table, and Boost.MultiIndex is the preferred choice. It is possible
 that other data will need to be indexed later.
 
-
- 
</div>
<div class="sidebar">

@@ -141,8 +119,6 @@

 This problem is better modelled as a collection of relations, and Boost.Bimap fits nicely here.
 
-
- 
</div>

 You can also read <a class="link" href="the_tutorial/additional_information.html" title="Additional information">Additional
@@ -151,16 +127,15 @@
</div>
<div class="footnotes">
 <hr width="100" align="left">
-<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.
- </div>
+<div class="footnote">[<a name="ftn.id789018" href="#id789018" 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.
+ </div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -168,7 +143,7 @@
</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>
+<a accesskey="p" href="the_tutorial/complete_instantiation_scheme.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<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.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<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,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="../bimap_and_boost.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bimap_and_boost.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="dependencies.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Boost Libraries that work well with Boost.Bimap">
+<div class="section">
<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 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>
@@ -39,7 +39,7 @@
<dt>Boost.Xpressive</dt>
<dt>Boost.Property_map</dt>
</dl></div>
-<div class="section" title="Introduction">
+<div class="section">
<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><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>
@@ -52,235 +52,235 @@
</colgroup>
<thead><tr>
<th>
- 
- Name
- 
+ 
+ Name
+ 
 </th>
<th>
- 
- Description
- 
+ 
+ Description
+ 
 </th>
<th>
- 
- author
- 
+ 
+ author
+ 
 </th>
<th>
- 
- Purpose
- 
+ 
+ Purpose
+ 
 </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- Boost.Serialization
- 
+ 
+ Boost.Serialization
+ 
 </td>
<td>
- 
- Serialization for persistence and marshalling
- 
+ 
+ Serialization for persistence and marshalling
+ 
 </td>
<td>
- 
- Robert Ramey
- 
+ 
+ Robert Ramey
+ 
 </td>
<td>
- 
- Serialization support for bimap containers and iterators
- 
+ 
+ Serialization support for bimap containers and iterators
+ 
 </td>
</tr>
<tr>
<td>
- 
- Boost.Assign
- 
+ 
+ Boost.Assign
+ 
 </td>
<td>
- 
- Filling containers with constant or generated data has never been
- easier
- 
+ 
+ Filling containers with constant or generated data has never
+ been easier
+ 
 </td>
<td>
- 
- Thorsten Ottosen
- 
+ 
+ Thorsten Ottosen
+ 
 </td>
<td>
- 
- Help to fill a bimap or views of it
- 
+ 
+ Help to fill a bimap or views of it
+ 
 </td>
</tr>
<tr>
<td>
- 
- Boost.Hash
- 
+ 
+ Boost.Hash
+ 
 </td>
<td>
- 
- A TR1 hash function object that can be extended to hash user defined
- types
- 
+ 
+ A TR1 hash function object that can be extended to hash user
+ defined types
+ 
 </td>
<td>
- 
- Daniel James
- 
+ 
+ Daniel James
+ 
 </td>
<td>
- 
- Default hashing function
- 
+ 
+ Default hashing function
+ 
 </td>
</tr>
<tr>
<td>
- 
- Boost.Lambda
- 
+ 
+ Boost.Lambda
+ 
 </td>
<td>
- 
- Define small unnamed function objects at the actual call site,
- and more
- 
+ 
+ Define small unnamed function objects at the actual call site,
+ and more
+ 
 </td>
<td>
- 
- from Jaakko Järvi, Gary Powell
- 
+ 
+ from Jaakko Järvi, Gary Powell
+ 
 </td>
<td>
- 
- Functors for modify, range, lower_bound and upper_bound
- 
+ 
+ Functors for modify, range, lower_bound and upper_bound
+ 
 </td>
</tr>
<tr>
<td>
- 
- Boost.Range
- 
+ 
+ Boost.Range
+ 
 </td>
<td>
- 
- A new infrastructure for generic algorithms that builds on top
- of the new iterator concepts
- 
+ 
+ A new infrastructure for generic algorithms that builds on top
+ of the new iterator concepts
+ 
 </td>
<td>
- 
- Thorsten Ottosen
- 
+ 
+ Thorsten Ottosen
+ 
 </td>
<td>
- 
- Range based algorithms
- 
+ 
+ Range based algorithms
+ 
 </td>
</tr>
<tr>
<td>
- 
- Boost.Foreach
- 
+ 
+ Boost.Foreach
+ 
 </td>
<td>
- 
- BOOST_FOREACH macro for easily iterating over the elements of a
- sequence
- 
+ 
+ BOOST_FOREACH macro for easily iterating over the elements of
+ a sequence
+ 
 </td>
<td>
- 
- Eric Niebler
- 
+ 
+ Eric Niebler
+ 
 </td>
<td>
- 
- Iteration
- 
+ 
+ Iteration
+ 
 </td>
</tr>
<tr>
<td>
- 
- Boost.Typeof
- 
+ 
+ Boost.Typeof
+ 
 </td>
<td>
- 
- Typeof operator emulation
- 
+ 
+ Typeof operator emulation
+ 
 </td>
<td>
- 
- Arkadiy Vertleyb, Peder Holt
- 
+ 
+ Arkadiy Vertleyb, Peder Holt
+ 
 </td>
<td>
- 
- Using BOOST_AUTO while we wait for C++0x
- 
+ 
+ Using BOOST_AUTO while we wait for C++0x
+ 
 </td>
</tr>
<tr>
<td>
- 
- Boost.Xpressive
- 
+ 
+ Boost.Xpressive
+ 
 </td>
<td>
- 
- Regular expressions that can be written as strings or as expression
- templates
- 
+ 
+ Regular expressions that can be written as strings or as expression
+ templates
+ 
 </td>
<td>
- 
- Eric Niebler
- 
+ 
+ Eric Niebler
+ 
 </td>
<td>
- 
- Help to fill a bimap from a string
- 
+ 
+ Help to fill a bimap from a string
+ 
 </td>
</tr>
<tr>
<td>
- 
- Boost.PropertyMap
- 
+ 
+ Boost.PropertyMap
+ 
 </td>
<td>
- 
- Concepts defining interfaces which map key objects to value objects
- 
+ 
+ Concepts defining interfaces which map key objects to value objects
+ 
 </td>
<td>
- 
- Jeremy Siek
- 
+ 
+ Jeremy Siek
+ 
 </td>
<td>
- 
- Integration with BGL
- 
+ 
+ Integration with BGL
+ 
 </td>
</tr>
</tbody>
</table></div>
</div>
-<div class="section" title="Boost.Serialization">
+<div class="section">
<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><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>
@@ -294,9 +294,7 @@
 code</a>
 

- 
-
-
+

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

@@ -309,9 +307,9 @@
 std::ofstream ofs("data");
 boost::archive::text_oarchive oa(ofs);

- 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>
+ 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 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");
+ <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);
@@ -341,29 +339,25 @@
}
</pre>

- 
+ 

 
-
- 
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
<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>
+ 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 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>
+ first. Note that the const cast is not requiered here because we create
+ our iterators as const. </td>
</tr>
</table></div>

- 
-
 

 Serialization capabilities are automatically provided by just linking with
@@ -375,9 +369,9 @@
 in build times, and may be necessary in those defective compilers that
 fail to correctly process Boost.Serialization headers.
 
-<div class="warning" title="Warning"><table border="0" summary="Warning">
+<div class="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>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../../../doc/src/images/warning.png"></td>
<th align="left">Warning</th>
</tr>
<tr><td align="left" valign="top">
@@ -403,7 +397,7 @@
 must be done only after serializing its corresponding container.
 
</div>
-<div class="section" title="Boost.Assign">
+<div class="section">
<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><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>
@@ -429,15 +423,13 @@
 <a href="../../../../example/bimap_and_boost/assign.cpp" target="_top">Go to source code</a>
 

- 
-
-
+

<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 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>
+ 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" );
@@ -468,24 +460,20 @@
 ( 13, "thirteen" );
 </pre>

- 
+ 

 
-
- 
<div class="calloutlist"><table border="0" summary="Callout list"><tr>
<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>
- type stores the elements as non const, a requirement of <code class="computeroutput">assign::list_of</code> </td>
+ 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>
+ type stores the elements as non const, a requirement of <code class="computeroutput">assign::list_of</code>
+ </td>
</tr></table></div>

- 
-
 
</div>
-<div class="section" title="Boost.Hash">
+<div class="section">
<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><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>
@@ -511,7 +499,7 @@
 the unordered set types with any user types.
 
</div>
-<div class="section" title="Boost.Lambda">
+<div class="section">
<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><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>
@@ -533,9 +521,7 @@
 <a href="../../../../example/bimap_and_boost/lambda.cpp" target="_top">Go to source code</a>
 

- 
-
-
+

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

@@ -550,11 +536,9 @@
bm.left.modify_data( bm.left.begin(), _data *= 10 );
</pre>

- 
-
 
</div>
-<div class="section" title="Boost.Range">
+<div class="section">
<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><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>
@@ -578,9 +562,7 @@
 If we have some generic functions that accepts ranges:
 

- 
-
-
+

<pre class="programlisting">template< class ForwardReadableRange, class UnaryFunctor >
UnaryFunctor for_each(const ForwardReadableRange & r, UnaryFunctor func)
@@ -614,17 +596,13 @@
}
</pre>

- 
-
 

 We can use them with Boost.Bimap with the help of the <code class="computeroutput">range</code>
 function.
 

- 
-
-
+

<pre class="programlisting">struct pair_printer
{
@@ -676,14 +654,12 @@
}
</pre>

- 
-
 

 <a href="../../../../example/bimap_and_boost/range.cpp" target="_top">Go to source code</a>
 
</div>
-<div class="section" title="Boost.Foreach">
+<div class="section">
<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><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>
@@ -703,9 +679,7 @@
 will be as efficient as a std::for_each iteration. Here are some examples:
 

- 
-
-
+

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

@@ -717,7 +691,7 @@

BOOST_FOREACH( bm_type::left_reference p, bm.left )
{
- ++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>
+ ++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 )
@@ -727,27 +701,21 @@

</pre>

- 
+ 

 
-
- 
<div class="calloutlist"><table border="0" summary="Callout list"><tr>
<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>
+ type in the right side. </td>
</tr></table></div>

- 
-
 

 You can use it directly with ranges too:
 

- 
-
-
+

<pre class="programlisting">BOOST_FOREACH( bm_type::left_reference p,
 ( bm.left.range( std::string("1") <= _key, _key < std::string("3") ) ))
@@ -762,14 +730,12 @@
}
</pre>

- 
-
 

 <a href="../../../../example/bimap_and_boost/foreach.cpp" target="_top">Go to source code</a>
 
</div>
-<div class="section" title="Boost.Typeof">
+<div class="section">
<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><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>
@@ -791,9 +757,7 @@
 If we have
 

- 
-
-
+

<pre class="programlisting">typedef bimap< tagged<std::string,name>, tagged<int,number> > bm_type;
bm_type bm;
@@ -801,16 +765,12 @@
bm.insert( bm_type::value_type("two" ,2) );
</pre>

- 
-
 

 The following code snippet
 

- 
-
-
+

<pre class="programlisting">for( bm_type::map_by<name>::iterator iter = bm.by<name>().begin();
 iter!=bm.by<name>().end(); ++iter)
@@ -822,16 +782,12 @@
std::cout << "2: " << iter->get<name>();
</pre>

- 
-
 

 can be rewrited as
 

- 
-
-
+

<pre class="programlisting">for( BOOST_AUTO(iter, bm.by<name>().begin()); iter!=bm.by<name>().end(); ++iter)
{
@@ -842,14 +798,12 @@
std::cout << "2: " << iter->get<name>();
</pre>

- 
-
 

 <a href="../../../../example/bimap_and_boost/typeof.cpp" target="_top">Go to source code</a>
 
</div>
-<div class="section" title="Boost.Xpressive">
+<div class="section">
<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><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>
@@ -859,9 +813,7 @@
 Here is an example (it is just beatifull)
 

- 
-
-
+

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

sregex rel = ( (s1= +_w) >> " <--> " >> (s2= +_d) )
[
- xp::ref(bm)->*insert( construct<bm_type::value_type>(s1, as<int>(s2)) )
+ xp::ref(bm)->*insert( xp::construct<bm_type::value_type>(s1, as<int>(s2)) )
];

sregex relations = rel >> *(+_s >> rel);
@@ -880,14 +832,12 @@
assert( bm.size() == 3 );
</pre>

- 
-
 

 <a href="../../../../example/bimap_and_boost/xpressive.cpp" target="_top">Go to source code</a>
 
</div>
-<div class="section" title="Boost.Property_map">
+<div class="section">
<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><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>
@@ -926,9 +876,7 @@
 code</a>
 

- 
-
-
+

<pre class="programlisting">template <typename AddressMap>
void foo(AddressMap & address_map)
@@ -956,14 +904,12 @@
}
</pre>

- 
-
 
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -971,7 +917,7 @@
</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>
+<a accesskey="p" href="../bimap_and_boost.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bimap_and_boost.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="dependencies.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Dependencies</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<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="next" href="../reference.html" title="Reference">
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="boost_libraries_that_work_well_with_boost_bimap.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bimap_and_boost.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Dependencies">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.bimap_and_boost.dependencies"></a><a class="link" href="dependencies.html" title="Dependencies">Dependencies</a>
</h3></div></div></div>
@@ -35,7 +35,7 @@
 is the heart of this library.
 
<div class="table">
-<a name="id591722"></a>Table 1.4. Boost Libraries needed by Boost.Bimap
+<a name="id797662"></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>
@@ -44,147 +44,147 @@
</colgroup>
<thead><tr>
<th>
- 
- Name
- 
- </th>
+ 
+ Name
+ 
+ </th>
<th>
- 
- Description
- 
- </th>
+ 
+ Description
+ 
+ </th>
<th>
- 
- author
- 
- </th>
+ 
+ author
+ 
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- Boost.MultiIndex
- 
- </td>
+ 
+ Boost.MultiIndex
+ 
+ </td>
<td>
- 
- Containers with multiple STL-compatible access interfaces
- 
- </td>
+ 
+ Containers with multiple STL-compatible access interfaces
+ 
+ </td>
<td>
- 
- Joaquín M López Muñoz
- 
- </td>
+ 
+ Joaquín M López Muñoz
+ 
+ </td>
</tr>
<tr>
<td>
- 
- Boost.MPL
- 
- </td>
+ 
+ Boost.MPL
+ 
+ </td>
<td>
- 
- Template metaprogramming framework of compile-time algorithms, sequences
- and metafunction classes
- 
- </td>
+ 
+ Template metaprogramming framework of compile-time algorithms,
+ sequences and metafunction classes
+ 
+ </td>
<td>
- 
- Aleksey Gurtovoy
- 
- </td>
+ 
+ Aleksey Gurtovoy
+ 
+ </td>
</tr>
<tr>
<td>
- 
- Boost.TypeTraits
- 
- </td>
+ 
+ Boost.TypeTraits
+ 
+ </td>
<td>
- 
- Templates for fundamental properties of types.
- 
- </td>
+ 
+ Templates for fundamental properties of types.
+ 
+ </td>
<td>
- 
- John Maddock, Steve Cleary
- 
- </td>
+ 
+ John Maddock, Steve Cleary
+ 
+ </td>
</tr>
<tr>
<td>
- 
- Boost.enable_if
- 
- </td>
+ 
+ Boost.enable_if
+ 
+ </td>
<td>
- 
- Selective inclusion of function template overloads
- 
- </td>
+ 
+ Selective inclusion of function template overloads
+ 
+ </td>
<td>
- 
- Jaakko Järvi, Jeremiah Willcock, Andrew Lumsdaine
- 
- </td>
+ 
+ Jaakko Järvi, Jeremiah Willcock, Andrew Lumsdaine
+ 
+ </td>
</tr>
<tr>
<td>
- 
- Boost.Iterators
- 
- </td>
+ 
+ Boost.Iterators
+ 
+ </td>
<td>
- 
- Iterator construction framework, adaptors, concepts, and more.
- 
- </td>
+ 
+ Iterator construction framework, adaptors, concepts, and more.
+ 
+ </td>
<td>
- 
- Dave Abrahams, Jeremy Siek, Thomas Witt
- 
- </td>
+ 
+ Dave Abrahams, Jeremy Siek, Thomas Witt
+ 
+ </td>
</tr>
<tr>
<td>
- 
- Boost.call_traits
- 
- </td>
+ 
+ Boost.call_traits
+ 
+ </td>
<td>
- 
- Defines types for passing parameters.
- 
- </td>
+ 
+ Defines types for passing parameters.
+ 
+ </td>
<td>
- 
- John Maddock, Howard Hinnant
- 
- </td>
+ 
+ John Maddock, Howard Hinnant
+ 
+ </td>
</tr>
<tr>
<td>
- 
- Boost.StaticAssert
- 
- </td>
+ 
+ Boost.StaticAssert
+ 
+ </td>
<td>
- 
- Static assertions (compile time assertions).
- 
- </td>
+ 
+ Static assertions (compile time assertions).
+ 
+ </td>
<td>
- 
- John Maddock
- 
- </td>
+ 
+ John Maddock
+ 
+ </td>
</tr>
</tbody>
</table></div>
</div>
 <div class="table">
-<a name="id591995"></a>Table 1.5. Optional Boost Libraries
+<a name="id797954"></a>Table 1.5. Optional Boost Libraries
<div class="table-contents"><table class="table" summary="Optional Boost Libraries">
<colgroup>
<col>
@@ -194,170 +194,169 @@
</colgroup>
<thead><tr>
<th>
- 
- Name
- 
- </th>
+ 
+ Name
+ 
+ </th>
<th>
- 
- Description
- 
- </th>
+ 
+ Description
+ 
+ </th>
<th>
- 
- author
- 
- </th>
+ 
+ author
+ 
+ </th>
<th>
- 
- Purpose
- 
- </th>
+ 
+ Purpose
+ 
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- Boost.Serialization
- 
- </td>
-<td>
- 
- Serialization for persistence and marshalling
- 
- </td>
-<td>
- 
- Robert Ramey
- 
- </td>
-<td>
- 
- Serialization support for bimap containers and iterators
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Boost.Assign
- 
- </td>
-<td>
- 
- Filling containers with constant or generated data has never been easier
- 
- </td>
-<td>
- 
- Thorsten Ottosen
- 
- </td>
-<td>
- 
- Help to fill a bimap or views of it
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Boost.Hash
- 
- </td>
-<td>
- 
- A TR1 hash function object that can be extended to hash user defined
- types
- 
- </td>
-<td>
- 
- Daniel James
- 
- </td>
-<td>
- 
- Default hashing function
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Boost.Lambda
- 
- </td>
-<td>
- 
- Define small unnamed function objects at the actual call site, and
- more
- 
- </td>
-<td>
- 
- from Jaakko Järvi, Gary Powell
- 
- </td>
-<td>
- 
- Functors for modify, range, lower_bound and upper_bound
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Boost.Range
- 
- </td>
-<td>
- 
- A new infrastructure for generic algorithms that builds on top of the
- new iterator concepts
- 
- </td>
-<td>
- 
- Thorsten Ottosen
- 
- </td>
-<td>
- 
- Range based algorithms
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Boost.PropertyMap
- 
- </td>
-<td>
- 
- Concepts defining interfaces which map key objects to value objects
- 
- </td>
-<td>
- 
- Jeremy Siek
- 
- </td>
-<td>
- 
- Integration with BGL
- 
- </td>
+ 
+ Boost.Serialization
+ 
+ </td>
+<td>
+ 
+ Serialization for persistence and marshalling
+ 
+ </td>
+<td>
+ 
+ Robert Ramey
+ 
+ </td>
+<td>
+ 
+ Serialization support for bimap containers and iterators
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Boost.Assign
+ 
+ </td>
+<td>
+ 
+ Filling containers with constant or generated data has never been
+ easier
+ 
+ </td>
+<td>
+ 
+ Thorsten Ottosen
+ 
+ </td>
+<td>
+ 
+ Help to fill a bimap or views of it
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Boost.Hash
+ 
+ </td>
+<td>
+ 
+ A TR1 hash function object that can be extended to hash user defined
+ types
+ 
+ </td>
+<td>
+ 
+ Daniel James
+ 
+ </td>
+<td>
+ 
+ Default hashing function
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Boost.Lambda
+ 
+ </td>
+<td>
+ 
+ Define small unnamed function objects at the actual call site,
+ and more
+ 
+ </td>
+<td>
+ 
+ from Jaakko Järvi, Gary Powell
+ 
+ </td>
+<td>
+ 
+ Functors for modify, range, lower_bound and upper_bound
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Boost.Range
+ 
+ </td>
+<td>
+ 
+ A new infrastructure for generic algorithms that builds on top
+ of the new iterator concepts
+ 
+ </td>
+<td>
+ 
+ Thorsten Ottosen
+ 
+ </td>
+<td>
+ 
+ Range based algorithms
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Boost.PropertyMap
+ 
+ </td>
+<td>
+ 
+ Concepts defining interfaces which map key objects to value objects
+ 
+ </td>
+<td>
+ 
+ Jeremy Siek
+ 
+ </td>
+<td>
+ 
+ Integration with BGL
+ 
+ </td>
</tr>
</tbody>
</table></div>
</div>
 <div class="table">
-<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">
+<a name="id798264"></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">
<colgroup>
<col>
<col>
@@ -365,38 +364,38 @@
</colgroup>
<thead><tr>
<th>
- 
- Name
- 
- </th>
+ 
+ Name
+ 
+ </th>
<th>
- 
- Description
- 
- </th>
+ 
+ Description
+ 
+ </th>
<th>
- 
- author
- 
- </th>
+ 
+ author
+ 
+ </th>
</tr></thead>
<tbody><tr>
<td>
- 
- Boost.Test
- 
- </td>
-<td>
- 
- Support for simple program testing, full unit testing, and for program
- execution monitoring.
- 
- </td>
-<td>
- 
- Gennadiy Rozental
- 
- </td>
+ 
+ Boost.Test
+ 
+ </td>
+<td>
+ 
+ Support for simple program testing, full unit testing, and for
+ program execution monitoring.
+ 
+ </td>
+<td>
+ 
+ Gennadiy Rozental
+ 
+ </td>
</tr></tbody>
</table></div>
</div>
@@ -404,7 +403,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -412,7 +411,7 @@
</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>
+<a accesskey="p" href="boost_libraries_that_work_well_with_boost_bimap.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bimap_and_boost.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Compiler specifics</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<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="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="next" href="performance.html" title="Performance">
</head>
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="reference/unconstrained_set_of_reference.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="performance.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Compiler specifics">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="boost_bimap.compiler_specifics"></a><a class="link" href="compiler_specifics.html" title="Compiler specifics">Compiler specifics</a>
</h2></div></div></div>
@@ -34,298 +34,298 @@
</colgroup>
<thead><tr>
<th>
- 
- Compiler
- 
+ 
+ Compiler
+ 
 </th>
<th>
- 
- OS Tested
- 
+ 
+ OS Tested
+ 
 </th>
<th>
- 
- State
- 
+ 
+ State
+ 
 </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- GCC 3.3
- 
+ 
+ GCC 3.3
+ 
 </td>
<td>
- 
- Linux
- 
+ 
+ Linux
+ 
 </td>
<td>
- 
- Supported
- 
+ 
+ Supported
+ 
 </td>
</tr>
<tr>
<td>
- 
- GCC 3.4
- 
+ 
+ GCC 3.4
+ 
 </td>
<td>
- 
- Linux
- 
+ 
+ Linux
+ 
 </td>
<td>
- 
- Supported
- 
+ 
+ Supported
+ 
 </td>
</tr>
<tr>
<td>
- 
- GCC 4.0
- 
+ 
+ GCC 4.0
+ 
 </td>
<td>
- 
- Linux, Mac
- 
+ 
+ Linux, Mac
+ 
 </td>
<td>
- 
- Supported
- 
+ 
+ Supported
+ 
 </td>
</tr>
<tr>
<td>
- 
- GCC 4.1
- 
+ 
+ GCC 4.1
+ 
 </td>
<td>
- 
- Linux
- 
+ 
+ Linux
+ 
 </td>
<td>
- 
- Supported
- 
+ 
+ Supported
+ 
 </td>
</tr>
<tr>
<td>
- 
- GCC 4.2
- 
+ 
+ GCC 4.2
+ 
 </td>
<td>
- 
- Linux
- 
+ 
+ Linux
+ 
 </td>
<td>
- 
- Supported
- 
+ 
+ Supported
+ 
 </td>
</tr>
<tr>
<td>
- 
- ICC 8.0
- 
+ 
+ ICC 8.0
+ 
 </td>
<td>
- 
- Linux
- 
+ 
+ Linux
+ 
 </td>
<td>
- 
- Supported
- 
+ 
+ Supported
+ 
 </td>
</tr>
<tr>
<td>
- 
- ICC 9.0
- 
+ 
+ ICC 9.0
+ 
 </td>
<td>
- 
- Linux
- 
+ 
+ Linux
+ 
 </td>
<td>
- 
- Supported
- 
+ 
+ Supported
+ 
 </td>
</tr>
<tr>
<td>
- 
- ICC 9.1
- 
+ 
+ ICC 9.1
+ 
 </td>
<td>
- 
- Linux
- 
+ 
+ Linux
+ 
 </td>
<td>
- 
- Supported
- 
+ 
+ Supported
+ 
 </td>
</tr>
<tr>
<td>
- 
- GCC 4.2
- 
+ 
+ GCC 4.2
+ 
 </td>
<td>
- 
- Linux
- 
+ 
+ Linux
+ 
 </td>
<td>
- 
- Supported
- 
+ 
+ Supported
+ 
 </td>
</tr>
<tr>
<td>
- 
- GCC 4.2
- 
+ 
+ GCC 4.2
+ 
 </td>
<td>
- 
- Linux
- 
+ 
+ Linux
+ 
 </td>
<td>
- 
- Supported
- 
+ 
+ Supported
+ 
 </td>
</tr>
<tr>
<td>
- 
- VS 7.1
- 
+ 
+ VS 7.1
+ 
 </td>
<td>
- 
- Windows
- 
+ 
+ Windows
+ 
 </td>
<td>
- 
- Supported
- 
+ 
+ Supported
+ 
 </td>
</tr>
<tr>
<td>
- 
- VS 8.0
- 
+ 
+ VS 8.0
+ 
 </td>
<td>
- 
- Windows
- 
+ 
+ Windows
+ 
 </td>
<td>
- 
- Supported
- 
+ 
+ Supported
+ 
 </td>
</tr>
<tr>
<td>
- 
- ICC 7.1
- 
+ 
+ ICC 7.1
+ 
 </td>
<td>
- 
- Windows
- 
+ 
+ Windows
+ 
 </td>
<td>
- 
- Not Supported
- 
+ 
+ Not Supported
+ 
 </td>
</tr>
<tr>
<td>
- 
- ICC 8.0
- 
+ 
+ ICC 8.0
+ 
 </td>
<td>
- 
- Windows
- 
+ 
+ Windows
+ 
 </td>
<td>
- 
- Supported
- 
+ 
+ Supported
+ 
 </td>
</tr>
<tr>
<td>
- 
- ICC 9.1
- 
+ 
+ ICC 9.1
+ 
 </td>
<td>
- 
- Windows
- 
+ 
+ Windows
+ 
 </td>
<td>
- 
- Supported
- 
+ 
+ Supported
+ 
 </td>
</tr>
<tr>
<td>
- 
- CW 8.3
- 
+ 
+ CW 8.3
+ 
 </td>
<td>
- 
- Windows
- 
+ 
+ Windows
+ 
 </td>
<td>
- 
- Not Supported
- 
+ 
+ Not Supported
+ 
 </td>
</tr>
</tbody>
</table></div>
<a name="boost_bimap.compiler_specifics.vs_7_1"></a><h3>
-<a name="id650190"></a>
+<a name="id857967"></a>
 <a class="link" href="compiler_specifics.html#boost_bimap.compiler_specifics.vs_7_1">VS 7.1</a>
 </h3>

@@ -334,7 +334,7 @@
 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="id650218"></a>
+<a name="id857995"></a>
 <a class="link" href="compiler_specifics.html#boost_bimap.compiler_specifics.vs_8_0">VS 8.0</a>
 </h3>

@@ -352,7 +352,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -360,7 +360,7 @@
</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>
+<a accesskey="p" href="reference/unconstrained_set_of_reference.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="performance.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Examples</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<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="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">
</head>
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="performance.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="examples/simple_bimap.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Examples">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="boost_bimap.examples"></a><a class="link" href="examples.html" title="Examples">Examples</a>
</h2></div></div></div>
@@ -35,7 +35,7 @@
<dt><a href="examples/multiindex_to_bimap_path___hashed_indices.html">MultiIndex
 to Bimap Path - Hashed indices</a></dt>
</dl></div>
-<div class="section" title="Examples list">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<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>
@@ -44,7 +44,7 @@
 find all the examples used in bimap documentation. Here is a list of them:
 
<div class="table">
-<a name="id650327"></a>Table 1.7. Tutorial examples
+<a name="id858104"></a>Table 1.7. Tutorial examples
<div class="table-contents"><table class="table" summary="Tutorial examples">
<colgroup>
<col>
@@ -52,193 +52,194 @@
</colgroup>
<thead><tr>
<th>
- 
- Program
- 
- </th>
+ 
+ Program
+ 
+ </th>
<th>
- 
- Description
- 
- </th>
+ 
+ Description
+ 
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- simple_bimap.cpp
- 
- </td>
+ 
+ simple_bimap.cpp
+ 
+ </td>
<td>
- 
- Soccer world cup example
- 
- </td>
+ 
+ Soccer world cup example
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <a href="../../../example/tagged_simple_bimap.cpp" target="_top">tagged_simple_bimap.cpp
- </a>
- 
- </td>
+ 
+ <a href="../../../example/tagged_simple_bimap.cpp" target="_top">tagged_simple_bimap.cpp
+ </a>
+ 
+ </td>
<td>
- 
- Soccer world cup example using user defined names
- 
- </td>
+ 
+ Soccer world cup example using user defined names
+ 
+ </td>
</tr>
<tr>
<td>
- 
- step_by_step.cpp
- 
- </td>
+ 
+ step_by_step.cpp
+ 
+ </td>
<td>
- 
- Basic example of the three views of bimap
- 
- </td>
+ 
+ Basic example of the three views of bimap
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <a href="../../../example/population_bimap.cpp" target="_top">population_bimap.cpp
- </a>
- 
- </td>
+ 
+ <a href="../../../example/population_bimap.cpp" target="_top">population_bimap.cpp
+ </a>
+ 
+ </td>
<td>
- 
- Countries populations, using <code class="computeroutput">unordered_set_of</code>
- and <code class="computeroutput">multiset_of</code>
- 
- </td>
+ 
+ Countries populations, using <code class="computeroutput">unordered_set_of</code>
+ and <code class="computeroutput">multiset_of</code>
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <a href="../../../example/repetitions_counter.cpp" target="_top">repetitions_counter.cpp
- </a>
- 
- </td>
+ 
+ <a href="../../../example/repetitions_counter.cpp" target="_top">repetitions_counter.cpp
+ </a>
+ 
+ </td>
<td>
- 
- Word repetitions counter, using <code class="computeroutput">unordered_set_of</code>
- and <code class="computeroutput">list_of</code>
- 
- </td>
+ 
+ Word repetitions counter, using <code class="computeroutput">unordered_set_of</code>
+ and <code class="computeroutput">list_of</code>
+ 
+ </td>
</tr>
<tr>
<td>
- 
- mighty_bimap.cpp
- 
- </td>
+ 
+ mighty_bimap.cpp
+ 
+ </td>
<td>
- 
- Dictionary using <code class="computeroutput">list_of_relation</code>
- 
- </td>
+ 
+ Dictionary using <code class="computeroutput">list_of_relation</code>
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <a href="../../../example/user_defined_names.cpp" target="_top">user_defined_names.cpp
- </a>
- 
- </td>
+ 
+ <a href="../../../example/user_defined_names.cpp" target="_top">user_defined_names.cpp
+ </a>
+ 
+ </td>
<td>
- 
- Equivalence between code with tagged and untagged code
- 
- </td>
+ 
+ Equivalence between code with tagged and untagged code
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <a href="../../../example/standard_map_comparison.cpp" target="_top">standard_map_comparison.cpp
- </a>
- 
- </td>
+ 
+ <a href="../../../example/standard_map_comparison.cpp" target="_top">standard_map_comparison.cpp
+ </a>
+ 
+ </td>
<td>
- 
- Comparison between standard maps and bimap map views
- 
- </td>
+ 
+ Comparison between standard maps and bimap map views
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <a href="../../../example/at_function_examples.cpp" target="_top">at_function_examples.cpp
- </a>
- 
- </td>
+ 
+ <a href="../../../example/at_function_examples.cpp" target="_top">at_function_examples.cpp
+ </a>
+ 
+ </td>
<td>
- 
- Functions <code class="computeroutput">at(key)</code>
- and <code class="computeroutput">operator[](key)</code>
- examples
- 
- </td>
+ 
+ Functions <code class="computeroutput">at(key)</code>
+ and <code class="computeroutput">operator[](key)</code>
+ examples
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <a href="../../../example/tutorial_modify_and_replace.cpp" target="_top">tutorial_modify_and_replace.cpp
- </a>
- 
- </td>
+ 
+ <a href="../../../example/tutorial_modify_and_replace.cpp" target="_top">tutorial_modify_and_replace.cpp
+ </a>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">modify</code> and <code class="computeroutput">replace</code> examples
- 
- </td>
+ 
+ <code class="computeroutput">modify</code> and <code class="computeroutput">replace</code> examples
+ 
+ </td>
</tr>
<tr>
<td>
- 
- tutorial_range.cpp
- 
- </td>
+ 
+ <a href="../../../example/tutorial_range.cpp" target="_top">tutorial_range.cpp
+ </a>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">range()</code>
- tutorial
- 
- </td>
+ 
+ <code class="computeroutput">range()</code>
+ tutorial
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <a href="../../../example/tutorial_info_hook.cpp" target="_top">tutorial_info_hook.cpp
- </a>
- 
- </td>
+ 
+ <a href="../../../example/tutorial_info_hook.cpp" target="_top">tutorial_info_hook.cpp
+ </a>
+ 
+ </td>
<td>
- 
- Additional information hooking
- 
- </td>
+ 
+ Additional information hooking
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <a href="../../../example/unconstrained_collection.cpp" target="_top">unconstrained_collection.cpp
- </a>
- 
- </td>
+ 
+ <a href="../../../example/unconstrained_collection.cpp" target="_top">unconstrained_collection.cpp
+ </a>
+ 
+ </td>
<td>
- 
- Using <code class="computeroutput">unconstrained_set_of</code>
- collection type
- 
- </td>
+ 
+ Using <code class="computeroutput">unconstrained_set_of</code>
+ collection type
+ 
+ </td>
</tr>
</tbody>
</table></div>
</div>
 <div class="table">
-<a name="id650801"></a>Table 1.8. Bimap and Boost examples
+<a name="id858595"></a>Table 1.8. Bimap and Boost examples
<div class="table-contents"><table class="table" summary="Bimap and Boost examples">
<colgroup>
<col>
@@ -246,122 +247,126 @@
</colgroup>
<thead><tr>
<th>
- 
- Program
- 
- </th>
+ 
+ Program
+ 
+ </th>
<th>
- 
- Description
- 
- </th>
+ 
+ Description
+ 
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- assign.cpp
- 
- </td>
+ 
+ <a href="../../../example/bimap_and_boost/assign.cpp" target="_top">assign.cpp
+ </a>
+ 
+ </td>
<td>
- 
- Bimap and Boost.Assign: Methods to insert elements
- 
- </td>
+ 
+ Bimap and Boost.Assign: Methods to insert elements
+ 
+ </td>
</tr>
<tr>
<td>
- 
- lambda.cpp
- 
- </td>
+ 
+ <a href="../../../example/bimap_and_boost/lambda.cpp" target="_top">lambda.cpp
+ </a>
+ 
+ </td>
<td>
- 
- Bimap and Boost.Lambda: new lambda placeholders
- 
- </td>
+ 
+ Bimap and Boost.Lambda: new lambda placeholders
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <a href="../../../example/bimap_and_boost/property_map.cpp" target="_top">property_map.cpp
- </a>
- 
- </td>
+ 
+ <a href="../../../example/bimap_and_boost/property_map.cpp" target="_top">property_map.cpp
+ </a>
+ 
+ </td>
<td>
- 
- Bimap and Boost.PropertyMap: PropertyMap support
- 
- </td>
+ 
+ Bimap and Boost.PropertyMap: PropertyMap support
+ 
+ </td>
</tr>
<tr>
<td>
- 
- range.cpp
- 
- </td>
+ 
+ <a href="../../../example/bimap_and_boost/range.cpp" target="_top">range.cpp
+ </a>
+ 
+ </td>
<td>
- 
- Bimap and Boost.Range: Using bimaps in the new range framework
- 
- </td>
+ 
+ Bimap and Boost.Range: Using bimaps in the new range framework
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <a href="../../../example/bimap_and_boost/foreach.cpp" target="_top">foreach.cpp
- </a>
- 
- </td>
+ 
+ <a href="../../../example/bimap_and_boost/foreach.cpp" target="_top">foreach.cpp
+ </a>
+ 
+ </td>
<td>
- 
- Bimap and Boost.Foreach: Iterating over bimaps
- 
- </td>
+ 
+ Bimap and Boost.Foreach: Iterating over bimaps
+ 
+ </td>
</tr>
<tr>
<td>
- 
- typeof.cpp
- 
- </td>
+ 
+ <a href="../../../example/bimap_and_boost/typeof.cpp" target="_top">typeof.cpp
+ </a>
+ 
+ </td>
<td>
- 
- Bimap and Boost.Typeof: using BOOST_AUTO while we wait for C++0x
- 
- </td>
+ 
+ Bimap and Boost.Typeof: using BOOST_AUTO while we wait for C++0x
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <a href="../../../example/bimap_and_boost/xpressive.cpp" target="_top">xpressive.cpp
- </a>
- 
- </td>
+ 
+ <a href="../../../example/bimap_and_boost/xpressive.cpp" target="_top">xpressive.cpp
+ </a>
+ 
+ </td>
<td>
- 
- Bimap and Boost.Xpressive: Inserting elements in a bimap
- 
- </td>
+ 
+ Bimap and Boost.Xpressive: Inserting elements in a bimap
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <a href="../../../example/bimap_and_boost/serialization.cpp" target="_top">serialization.cpp:
- </a>
- 
- </td>
+ 
+ <a href="../../../example/bimap_and_boost/serialization.cpp" target="_top">serialization.cpp:
+ </a>
+ 
+ </td>
<td>
- 
- Bimap and Boost.Serialization: Load and save bimaps and iterators
- 
- </td>
+ 
+ Bimap and Boost.Serialization: Load and save bimaps and iterators
+ 
+ </td>
</tr>
</tbody>
</table></div>
</div>
 <div class="table">
-<a name="id651020"></a>Table 1.9. Boost.MultiIndex to Boost.Bimap path examples
+<a name="id858826"></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>
@@ -369,55 +374,55 @@
</colgroup>
<thead><tr>
<th>
- 
- Program
- 
- </th>
+ 
+ Program
+ 
+ </th>
<th>
- 
- Description
- 
- </th>
+ 
+ Description
+ 
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- <a href="../../../example/mi_to_b_path/bidirectional_map.cpp" target="_top">bidirectional_map.cpp
- </a>
- 
- </td>
-<td>
- 
- Boost.MultiIndex to Boost.Bimap path example
- 
- </td>
+ 
+ <a href="../../../example/mi_to_b_path/bidirectional_map.cpp" target="_top">bidirectional_map.cpp
+ </a>
+ 
+ </td>
+<td>
+ 
+ Boost.MultiIndex to Boost.Bimap path example
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <a href="../../../example/mi_to_b_path/hashed_indices.cpp" target="_top">hashed_indices.cpp
- </a>
- 
- </td>
-<td>
- 
- Boost.MultiIndex to Boost.Bimap path example
- 
- </td>
+ 
+ <a href="../../../example/mi_to_b_path/hashed_indices.cpp" target="_top">hashed_indices.cpp
+ </a>
+ 
+ </td>
+<td>
+ 
+ Boost.MultiIndex to Boost.Bimap path example
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <a href="../../../example/mi_to_b_path/tagged_bidirectional_map.cpp" target="_top">tagged_bidirectional_map.cpp
- </a>
- 
- </td>
-<td>
- 
- Boost.MultiIndex to Boost.Bimap path example
- 
- </td>
+ 
+ <a href="../../../example/mi_to_b_path/tagged_bidirectional_map.cpp" target="_top">tagged_bidirectional_map.cpp
+ </a>
+ 
+ </td>
+<td>
+ 
+ Boost.MultiIndex to Boost.Bimap path example
+ 
+ </td>
</tr>
</tbody>
</table></div>
@@ -427,7 +432,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -435,7 +440,7 @@
</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>
+<a accesskey="p" href="performance.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="examples/simple_bimap.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Mighty Bimap</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<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">
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="simple_bimap.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="multiindex_to_bimap_path___bidirectional_map.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Mighty Bimap">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<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>
@@ -34,9 +34,7 @@
 <a href="../../../../example/mighty_bimap.cpp" target="_top">Go to source code</a>
 

- 
-
-
+

<pre class="programlisting">#include <iostream>
#include <string>
@@ -121,13 +119,11 @@
}
</pre>

- 
-
 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -135,7 +131,7 @@
</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>
+<a accesskey="p" href="simple_bimap.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="multiindex_to_bimap_path___bidirectional_map.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<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.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<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">
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="mighty_bimap.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="multiindex_to_bimap_path___hashed_indices.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="MultiIndex to Bimap Path - Bidirectional Map">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<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>
@@ -42,7 +42,7 @@
 
</div>
<a name="boost_bimap.examples.multiindex_to_bimap_path___bidirectional_map.boost_multiindex"></a><h5>
-<a name="id655859"></a>
+<a name="id863650"></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>

@@ -50,9 +50,7 @@
 code</a>
 

- 
-
-
+

<pre class="programlisting">#include <iostream>
#include <boost/tokenizer.hpp>
@@ -146,11 +144,9 @@
}
</pre>

- 
-
 
<a name="boost_bimap.examples.multiindex_to_bimap_path___bidirectional_map.boost_bimap"></a><h5>
-<a name="id657572"></a>
+<a name="id865360"></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>

@@ -158,9 +154,7 @@
 code</a>
 

- 
-
-
+

<pre class="programlisting">#include <iostream>
#include <boost/tokenizer.hpp>
@@ -198,7 +192,7 @@
 // the second part of the element is the equivalent in English

 std::cout << word << " is said "
- << 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>
+ << 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
@@ -209,7 +203,7 @@
 if( it2 != d.right.end() )
 {
 std::cout << word << " is said "
- << 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>
+ << 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
@@ -222,28 +216,24 @@
}
</pre>

- 
+ 

 
-
- 
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
<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>
+ 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 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>
+ 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>
</tr>
</table></div>

- 
-
 

 Or better, using tags...
@@ -253,9 +243,7 @@
 source code</a>
 

- 
-
-
+

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

@@ -326,13 +314,11 @@
}
</pre>

- 
-
 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -340,7 +326,7 @@
</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>
+<a accesskey="p" href="mighty_bimap.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="multiindex_to_bimap_path___hashed_indices.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<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.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<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="next" href="../test_suite.html" title="Test suite">
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="multiindex_to_bimap_path___bidirectional_map.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../test_suite.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="MultiIndex to Bimap Path - Hashed indices">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<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>
@@ -40,7 +40,7 @@
 
</div>
<a name="boost_bimap.examples.multiindex_to_bimap_path___hashed_indices.boost_multiindex"></a><h5>
-<a name="id660222"></a>
+<a name="id867998"></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>

@@ -48,9 +48,7 @@
 code</a>
 

- 
-
-
+

<pre class="programlisting">#include <iostream>
#include <iomanip>
@@ -136,20 +134,16 @@
}
</pre>

- 
-
 
<a name="boost_bimap.examples.multiindex_to_bimap_path___hashed_indices.boost_bimap"></a><h5>
-<a name="id661922"></a>
+<a name="id869694"></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>
 

- 
-
-
+

<pre class="programlisting">#include <iostream>
#include <iomanip>
@@ -226,13 +220,11 @@
}
</pre>

- 
-
 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -240,7 +232,7 @@
</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>
+<a accesskey="p" href="multiindex_to_bimap_path___bidirectional_map.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../test_suite.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Simple Bimap</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<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">
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="../examples.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mighty_bimap.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Simple Bimap">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<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>
@@ -33,9 +33,7 @@
 <a href="../../../../example/simple_bimap.cpp" target="_top">Go to source code</a>
 

- 
-
-
+

<pre class="programlisting">#include <string>
#include <iostream>
@@ -95,8 +93,6 @@
}
</pre>

- 
-
 

 You can rewrite it using tags to gain readability.
@@ -105,9 +101,7 @@
 <a href="../../../../example/tagged_simple_bimap.cpp" target="_top">Go to source code</a>
 

- 
-
-
+

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

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

- <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
+ <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 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 >() << ") "
+ <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;
 }

@@ -154,13 +148,13 @@
 "their final position:"
 << std::endl;

- <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
+ <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 )
 {
 std::cout << i->get<country>() << " ends "
- << i->get<place >() << "º"
+ << i->get<place >() << "º"
 << std::endl;
 }

@@ -168,38 +162,33 @@
}
</pre>

- 
+ 

 
-
- 
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
<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>
+ 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 valign="top" align="left"> <code class="computeroutput">get<Tag></code>
- works for each view of the bimap </td>
+ works for each view of the bimap </td>
</tr>
<tr>
<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>
+ is equivalent to <code class="computeroutput">results.left</code> </td>
</tr>
</table></div>

- 
-
 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -207,7 +196,7 @@
</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>
+<a accesskey="p" href="../examples.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mighty_bimap.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Future work</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<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="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">
</head>
@@ -13,21 +13,21 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="test_suite.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="release_notes.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Future work">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<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="id664672"></a>
+<a name="id872205"></a>
 <a class="link" href="future_work.html#boost_bimap.future_work.rearrange_function">Rearrange Function</a>
 </h4>

@@ -37,7 +37,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -45,7 +45,7 @@
</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>
+<a accesskey="p" href="test_suite.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="release_notes.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>History</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<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="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">
</head>
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="rationale/the_student_and_the_mentor.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="history/multiindex_and_bimap.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="History">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="boost_bimap.history"></a><a class="link" href="history.html" title="History">History</a>
</h2></div></div></div>
@@ -32,7 +32,7 @@
<dt><a href="history/multiindex_and_bimap.html">MultiIndex
 and Bimap</a></dt>
</dl></div>
-<div class="section" title="The long path from Code Project to Boost">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<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>
@@ -42,62 +42,62 @@
<dl>
<dt>2002 - bimap at Code Project</dt>
<dd>
- Joaquin Lopez Muñoz posted his first <a href="http://www.codeproject.com/vcpp/stl/bimap.asp#test_suite" target="_top">bimap
- library</a> in 2002. Tons of users have been using it. He then <a href="http://aspn.activestate.com/ASPN/Mail/Message/boost/1404881" target="_top">asked
- the list for interest</a> in his library in 2003. Luckily, there
- was a lot of interest and Joaquin started to boostify the code. At some
- point all the developers seemed to agree that, rather than a bidirectional
- map, it would be better to work on an N-indexed set that contained Joaquin's
- library as a particular case.
- </dd>
+ Joaquin Lopez Muñoz posted his first <a href="http://www.codeproject.com/vcpp/stl/bimap.asp#test_suite" target="_top">bimap
+ library</a> in 2002. Tons of users have been using it. He then
+ <a href="http://aspn.activestate.com/ASPN/Mail/Message/boost/1404881" target="_top">asked
+ the list for interest</a> in his library in 2003. Luckily, there
+ was a lot of interest and Joaquin started to boostify the code. At
+ some point all the developers seemed to agree that, rather than a bidirectional
+ map, it would be better to work on an N-indexed set that contained
+ Joaquin's library as a particular case.
+ </dd>
<dt>2003 - multiindex_set</dt>
<dd>
- The library grew enormously and was ready for a formal review in 2003.
- At this point, the container was a lot more powerful, but everything
- comes with a price and this new beast lacked the simplicity of the original
- bimap.
- </dd>
+ The library grew enormously and was ready for a formal review in 2003.
+ At this point, the container was a lot more powerful, but everything
+ comes with a price and this new beast lacked the simplicity of the
+ original bimap.
+ </dd>
<dt>2004 - indexed_set</dt>
<dd>
- In 2004, the formal review ended well for the new multi-indexed container.
- This Swiss army knife introduced several new features, such as non-unique
- indexes, hashed indices and sequenced indices. In the list of improvements
- to the library, it was mentioned that a bidirectional map should be coded
- in top of this container.
- </dd>
+ In 2004, the formal review ended well for the new multi-indexed container.
+ This Swiss army knife introduced several new features, such as non-unique
+ indexes, hashed indices and sequenced indices. In the list of improvements
+ to the library, it was mentioned that a bidirectional map should be
+ coded in top of this container.
+ </dd>
<dt>2005 - multi_index_container</dt>
<dd>
- Once in Boost, the library switched to the now familiar name "Boost.MultiIndex".
- Late in 2004, it formally became a member of Boost. Joaquin continued
- to enchance the library and added new features such as composite keys
- and random-access indices.
- </dd>
-<dt>2006 - Multi Index Specialized Containers
- SoC project</dt>
-<dd>
- In 2006, during the formal review of Boost.Property_tree, the need for
- a bidirectional map container built on top of Boost.MultiIndex arose
- again. Boost entered the Google SoC 2006 as a mentor organization at
- the same time. Joaquin put himself forward as a mentor. He proposed to
- build not only a bidirectional map, but a myriad multi-indexed specialized
- containers. Matias Capeletto presented an application to code Boost.Misc
- for the SoC and was elected, along with nine other students. Matias's
- and Joaquin's SoC project ends with a working implementation of the bimap
- library that was presented in an informal review. By the end of the year
- the library was queued for a formal review.
- </dd>
+ Once in Boost, the library switched to the now familiar name "Boost.MultiIndex".
+ Late in 2004, it formally became a member of Boost. Joaquin continued
+ to enchance the library and added new features such as composite keys
+ and random-access indices.
+ </dd>
+<dt>2006 - Multi Index Specialized Containers SoC project</dt>
+<dd>
+ In 2006, during the formal review of Boost.Property_tree, the need
+ for a bidirectional map container built on top of Boost.MultiIndex
+ arose again. Boost entered the Google SoC 2006 as a mentor organization
+ at the same time. Joaquin put himself forward as a mentor. He proposed
+ to build not only a bidirectional map, but a myriad multi-indexed specialized
+ containers. Matias Capeletto presented an application to code Boost.Misc
+ for the SoC and was elected, along with nine other students. Matias's
+ and Joaquin's SoC project ends with a working implementation of the
+ bimap library that was presented in an informal review. By the end
+ of the year the library was queued for a formal review.
+ </dd>
<dt>2007 - Boost.Bimap</dt>
<dd>
- The formal review took place at the beggining of the year and Boost.Bimap
- was accepted in Boost.
- </dd>
+ The formal review took place at the beggining of the year and Boost.Bimap
+ was accepted in Boost.
+ </dd>
</dl>
</div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -105,7 +105,7 @@
</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>
+<a accesskey="p" href="rationale/the_student_and_the_mentor.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="history/multiindex_and_bimap.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>MultiIndex and Bimap</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<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,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="../history.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../history.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../acknowledgements.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="MultiIndex and Bimap">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<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>
@@ -36,62 +36,38 @@

 Marcin
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- The biggest virtue of property_tree is easy to use interface.
- If we try to make generic tree of it, it will be compromised. 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ The biggest virtue of property_tree is easy to use interface.
+ If we try to make generic tree of it, it will be compromised. 
+ </blockquote></div>

 Gennadiy
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- IMO the same result (as library presents) could be achieved
- just by using multi_index. 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ IMO the same result (as library presents) could be achieved
+ just by using multi_index. 
+ </blockquote></div>

 Marcin
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Could you elaborate more on that? I considered use of multi_index
- to implement indexing for properties, but it only affected the implementation
- part of library, not interface, and because I already had a working,
- exception safe solution, I didn't see the reason to dump it and add another
- dependency on another library. 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Could you elaborate more on that? I considered use of multi_index
+ to implement indexing for properties, but it only affected the implementation
+ part of library, not interface, and because I already had a working, exception
+ safe solution, I didn't see the reason to dump it and add another dependency
+ on another library. 
+ </blockquote></div>

 Gennadiy
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- I mean why do I need this half baked property_tree as another
- data structure? Property tree supports nothing in itself. It's just a
- data structure. You have parsers that produce property tree out of different
- sources. But you mat as well produce maps or something else. Here for
- example All that I need to do to "implement" similar functionality
- as your property tree: 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ I mean why do I need this half baked property_tree as another
+ data structure? Property tree supports nothing in itself. It's just a data
+ structure. You have parsers that produce property tree out of different
+ sources. But you mat as well produce maps or something else. Here for example
+ All that I need to do to "implement" similar functionality as
+ your property tree: 
+ </blockquote></div>



@@ -128,15 +104,9 @@
</pre>

 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Use it like this: 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Use it like this: 
+ </blockquote></div>



@@ -147,415 +117,231 @@
</pre>

 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Now tell me how property_tree interface is easier? And what
- is the value in 50k of Code you need to implement this data structure.
- 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Now tell me how property_tree interface is easier? And what
+ is the value in 50k of Code you need to implement this data structure.
+ 
+ </blockquote></div>

 Thorsten
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Seriously Gennadiy, do you really see newbies writing the
- code you just did? 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Seriously Gennadiy, do you really see newbies writing the code
+ you just did? 
+ </blockquote></div>

 Marcin
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- What you just implemented is stripped down, bare bones version
- of property_tree that, among other things, does not allow you to produce
- human editable XML files. Now add more interface (aka get functions),
- add more archives to serialization lib, add customization, add transparent
- translation from strings to arbitrary types and vice versa. Spend some
- weeks trying to get all the corner cases right, and then some more weeks
- trying to smooth rough edges in the interface. Then write tests. Write
- docs. At the end, I believe you will not get much less code than there
- is in the library already. Maybe you get some savings by using multi_index
- instead of manual indexing. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- The reason why ptree does not use multi index is because implementation
- existed long before I considered submitting to boost, probably before
- even I knew of multi index existence. It was working well. Later, when
- I was improving it during pre-review process, I seriously considered
- using multi-index. But I decided it is not worth throwing everything
- out. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Although ptree has large interface with many functions modifying
- state of the tree, it uses "single point of change" approach.
- Every insert eventually goes through one function, which takes care of
- exception safety and keeping index in sync with data. The same applies
- to erase. This function has 9 lines of code in case of insert, and (by
- coincidence) also 9 in case of erase. By using multi index these functions
- would obviously be simplified, maybe to 4 lines each. Net gain: 10 lines
- of code (out of several hundred in ptree_implementation.hpp). 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- I'm aware that there are performance gains to be reaped as
- well, but at that time I was rather focusing on getting the interface
- right. 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ What you just implemented is stripped down, bare bones version
+ of property_tree that, among other things, does not allow you to produce
+ human editable XML files. Now add more interface (aka get functions), add
+ more archives to serialization lib, add customization, add transparent
+ translation from strings to arbitrary types and vice versa. Spend some
+ weeks trying to get all the corner cases right, and then some more weeks
+ trying to smooth rough edges in the interface. Then write tests. Write
+ docs. At the end, I believe you will not get much less code than there
+ is in the library already. Maybe you get some savings by using multi_index
+ instead of manual indexing. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ The reason why ptree does not use multi index is because implementation
+ existed long before I considered submitting to boost, probably before even
+ I knew of multi index existence. It was working well. Later, when I was
+ improving it during pre-review process, I seriously considered using multi-index.
+ But I decided it is not worth throwing everything out. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Although ptree has large interface with many functions modifying
+ state of the tree, it uses "single point of change" approach.
+ Every insert eventually goes through one function, which takes care of
+ exception safety and keeping index in sync with data. The same applies
+ to erase. This function has 9 lines of code in case of insert, and (by
+ coincidence) also 9 in case of erase. By using multi index these functions
+ would obviously be simplified, maybe to 4 lines each. Net gain: 10 lines
+ of code (out of several hundred in ptree_implementation.hpp). 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ I'm aware that there are performance gains to be reaped as well,
+ but at that time I was rather focusing on getting the interface right.
+ 
+ </blockquote></div>

 Dave
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- That's perfectly reasonable, but (through no fault of yours)
- it misses the point I was trying to make. I guess I should have said,
- "...that demonstrates it to be the best implementation." 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- All I'm saying is that the extent to which a Boost library
- implementation should leverage other Boost libraries is not a question
- that can always be decided based on following simple guidelines, and
- that if this library is accepted, it's worth revisiting your decision.
- 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ That's perfectly reasonable, but (through no fault of yours)
+ it misses the point I was trying to make. I guess I should have said, "...that
+ demonstrates it to be the best implementation." 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ All I'm saying is that the extent to which a Boost library implementation
+ should leverage other Boost libraries is not a question that can always
+ be decided based on following simple guidelines, and that if this library
+ is accepted, it's worth revisiting your decision. 
+ </blockquote></div>

 Thorsten
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- I think it is important to focus on the interface in the review,
- but I also see several benefits of an implementation that builds on Boost.MultiIndex:'
- 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - fewer bugs like the one Joaquin found
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - better space efficiency
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - exception-safety guarantees are immediately full-filled (I
- haven't looked, but I suspect that there are several bugs in this area)
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ I think it is important to focus on the interface in the review,
+ but I also see several benefits of an implementation that builds on Boost.MultiIndex:'
+ 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - fewer bugs like the one Joaquin found
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - better space efficiency
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - exception-safety guarantees are immediately full-filled (I
+ haven't looked, but I suspect that there are several bugs in this area)
+ </blockquote></div>

 Daniel
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Multi_index supports everything a bimap would, but its interface
- is more cumbersome. I for one won't use a W3DOM-like library if we get
- one, but I would happily use property_tree. I've also only used multi_index
- once, and that was to use it as a bidirectional map. Property_tree covers
- other areas as well as being a potential subset of an XML library, but
- I still hold there is value in such a subset. 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Multi_index supports everything a bimap would, but its interface
+ is more cumbersome. I for one won't use a W3DOM-like library if we get
+ one, but I would happily use property_tree. I've also only used multi_index
+ once, and that was to use it as a bidirectional map. Property_tree covers
+ other areas as well as being a potential subset of an XML library, but
+ I still hold there is value in such a subset. 
+ </blockquote></div>

 Boris
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- I haven't used program_options yet. But if I understand correctly
- both libraries seem to support storing and accessing data with strings
- that might describe some kind of hierarchy. This seems to be the core
- idea of both libraries - is this correct? 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Then it wouldn't matter much what container is used. However
- a generic tree which can store data hierarchically probably makes most
- sense. If I understand correctly both libraries could make use of such
- a class? 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ I haven't used program_options yet. But if I understand correctly
+ both libraries seem to support storing and accessing data with strings
+ that might describe some kind of hierarchy. This seems to be the core idea
+ of both libraries - is this correct? 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Then it wouldn't matter much what container is used. However
+ a generic tree which can store data hierarchically probably makes most
+ sense. If I understand correctly both libraries could make use of such
+ a class? 
+ </blockquote></div>

 Marcin
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- I think generic tree container is material for another library.
- Whether property_tree should be based on it or not is a matter of internal
- implementation, and generally of little interest to users. The biggest
- value of property_tree is in its easy to use interface, that should not
- be compromised, if at all possible. I have been already reassured in
- this view by quite many people who took their time to review the library.
- 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ I think generic tree container is material for another library.
+ Whether property_tree should be based on it or not is a matter of internal
+ implementation, and generally of little interest to users. The biggest
+ value of property_tree is in its easy to use interface, that should not
+ be compromised, if at all possible. I have been already reassured in this
+ view by quite many people who took their time to review the library. 
+ </blockquote></div>

 Boris
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- I was trying to see the big picture: I rather prefer a C++
- standard based on a few well-known concepts like containers, iterators,
- algorithms etc. instead of having a C++ standard with hundreds of components
- which are tailored for specific needs, collaborate with only a handful
- of other components and think they provide an easy-to-use interface while
- all the easy-to-use interfaces make the whole standard less easy-to-use.
- 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- That said I have used your property tree library myself to
- read and write a configuration file. It was indeed very easy to use.
- However it would have been even easier if it was something I had known
- before like eg. an iterator. For now I will definitely use your property
- tree library but would appreciate if existing concepts were reused many
- C++ developers are familiar with. My opinion is that your library should
- be a part of Boost but should be more generalized in the future. 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ I was trying to see the big picture: I rather prefer a C++ standard
+ based on a few well-known concepts like containers, iterators, algorithms
+ etc. instead of having a C++ standard with hundreds of components which
+ are tailored for specific needs, collaborate with only a handful of other
+ components and think they provide an easy-to-use interface while all the
+ easy-to-use interfaces make the whole standard less easy-to-use. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ That said I have used your property tree library myself to read
+ and write a configuration file. It was indeed very easy to use. However
+ it would have been even easier if it was something I had known before like
+ eg. an iterator. For now I will definitely use your property tree library
+ but would appreciate if existing concepts were reused many C++ developers
+ are familiar with. My opinion is that your library should be a part of
+ Boost but should be more generalized in the future. 
+ </blockquote></div>

 Thorsten
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Well, I think we need both. Boost.MultiIndex is a great library
- and can do all kinds of wonderful things. But I would still like to see
- a bidirectional map (boost::bimap) written as a wrapper around it to
- get an easy and specialized interface. 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Well, I think we need both. Boost.MultiIndex is a great library
+ and can do all kinds of wonderful things. But I would still like to see
+ a bidirectional map (boost::bimap) written as a wrapper around it to get
+ an easy and specialized interface. 
+ </blockquote></div>

 Pavel
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Bimap is available in libs/multi-index/examples/bimap.cpp.
- 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Bimap is available in libs/multi-index/examples/bimap.cpp.
+ 
+ </blockquote></div>

 Thorsten
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Right, but the real value comes when somebody designs a nice
- STL-like interface and write docs etc, at least that was my point. 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Right, but the real value comes when somebody designs a nice
+ STL-like interface and write docs etc, at least that was my point. 
+ </blockquote></div>

 Dave
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- IMO Thorsten is exactly right. This is precisely the sort
- of thing that could be added to the library as part of its ongoing maintenance
- and development (without review, of course). 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ IMO Thorsten is exactly right. This is precisely the sort of
+ thing that could be added to the library as part of its ongoing maintenance
+ and development (without review, of course). 
+ </blockquote></div>

 Joaquin
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Thorsten, we have talked about this privately in the past,
- but I feel like bringing it to the list in the hope of getting the attention
- of potential contributors: 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- There are some data structures buildable with B.MI which are
- regarded as particularly useful or common, like for instance the bidirectional
- map or bimap. A lean and mean implementation is provided in the aforementioned
- example, but certainly a much carefully crafted interface can be provided
- keeping B.MI as the implementation core: operator[], selection of 1-1/1-N/N-1/N-N
- variants, hashing/ordering, etc. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- I'm afraid I don't have the time to pursue this, as the current
- roadmap for core features of B.MI is taking all the spare time I can
- dedicate to the library. For this reason, I would love to see some volunteer
- jumping in who can develop this and other singular containers using B.MI
- (a cache container comes to mind) and then propose the results here either
- as a stand alone library of as part of B.MI --I'd prefer the former so
- as to keep the size of B.MI bounded. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- If there's such a volunteer I can provide her with some help/mentoring.
- I also wonder whether this is a task suitable to be proposed for Google
- Summer of Code. 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Thorsten, we have talked about this privately in the past, but
+ I feel like bringing it to the list in the hope of getting the attention
+ of potential contributors: 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ There are some data structures buildable with B.MI which are
+ regarded as particularly useful or common, like for instance the bidirectional
+ map or bimap. A lean and mean implementation is provided in the aforementioned
+ example, but certainly a much carefully crafted interface can be provided
+ keeping B.MI as the implementation core: operator[], selection of 1-1/1-N/N-1/N-N
+ variants, hashing/ordering, etc. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ I'm afraid I don't have the time to pursue this, as the current
+ roadmap for core features of B.MI is taking all the spare time I can dedicate
+ to the library. For this reason, I would love to see some volunteer jumping
+ in who can develop this and other singular containers using B.MI (a cache
+ container comes to mind) and then propose the results here either as a
+ stand alone library of as part of B.MI --I'd prefer the former so as to
+ keep the size of B.MI bounded. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ If there's such a volunteer I can provide her with some help/mentoring.
+ I also wonder whether this is a task suitable to be proposed for Google
+ Summer of Code. 
+ </blockquote></div>

 Thorsten
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- I think it would be good for SOC. All the really hard things
- are taken care of by B.MI, and so it seems reasonable for a student to
- be able to fill in the details. 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ I think it would be good for SOC. All the really hard things
+ are taken care of by B.MI, and so it seems reasonable for a student to
+ be able to fill in the details. 
+ </blockquote></div>

 Dave
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Great! 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Great! 
+ </blockquote></div>

 Jeff
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Please write a proposal! 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Please write a proposal! 
+ </blockquote></div>

 Joaquin
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- I've just done so: 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ I've just done so: 
+ </blockquote></div>
<div class="sidebar">


@@ -663,40 +449,22 @@

 Matias
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- I am planning to submit an application to SoC. I will love
- to make real the specialized containers you mention and try to include
- some useful others. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- <code class="literal"> And then... after long hours of coding (and fun) this library
- saw the light. </code>
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- <img src="../../images/bimap/boost.bimap.logo.png" alt="boost.bimap.logo">
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ I am planning to submit an application to SoC. I will love to
+ make real the specialized containers you mention and try to include some
+ useful others. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ <code class="literal"> And then... after long hours of coding (and fun) this library
+ saw the light. </code>
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ <img src="../../images/bimap/boost.bimap.logo.png" alt="boost.bimap.logo">
+ </blockquote></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -704,7 +472,7 @@
</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>
+<a accesskey="p" href="../history.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../history.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../acknowledgements.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,33 +1,33 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Introduction</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<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="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">
</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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="../index.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="one_minute_tutorial.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Introduction">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<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="id554159"></a>
+<a name="id759905"></a>
 <a class="link" href="introduction.html#boost_bimap.introduction.how_to_use_this_document">How to use
 this document</a>
 </h4>
@@ -39,43 +39,40 @@
<div class="variablelist">

<dl>
-<dt>I have to finished this today, I just want
- a bidirectional map!</dt>
+<dt>I have to finished this today, I just want 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 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>
-<dt>I am a serious programmer and want to learn
- Boost.Bimap</dt>
+ If your boss will kill you if the project is not finished by the end
+ of 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>
+<dt>I am a serious programmer and want to learn 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 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
- function signature or to find a specific metafunction.
- </dd>
-<dt>I just love C++, I want to see the inner
- workings of Boost.Bimap.</dt>
+ Boost.Bimap has a lot to offer if you are prepared to spend some time
+ reading 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 function signature or to find a specific metafunction.
+ </dd>
+<dt>I just love C++, I want to see the inner workings of Boost.Bimap.</dt>
<dd>
- If you are a library developer, this documentation is the best place to
- learn how Boost.Bimap is implemented. It is strongly recommended that you
- first learn to use the library as if you were the second type of programmer
- above. This library was developed in the Google SoC 2006, and the mentor
- and student generated a great deal of documentation in the building process.
- The rationale section is very large and contains a lot of information.
- There is a history section for those who might find it useful. Finally,
- in the reference section, each entity of the library is documented and
- its source code is presented.
- </dd>
+ If you are a library developer, this documentation is the best place
+ to learn how Boost.Bimap is implemented. It is strongly recommended that
+ you first learn to use the library as if you were the second type of
+ programmer above. This library was developed in the Google SoC 2006,
+ and the mentor and student generated a great deal of documentation in
+ the building process. The rationale section is very large and contains
+ a lot of information. There is a history section for those who might
+ find it useful. Finally, in the reference section, each entity of the
+ library is documented and its source code is presented.
+ </dd>
</dl>
</div>
-<div class="note" title="Note"><table border="0" summary="Note">
+<div class="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>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
<tr><td align="left" valign="top">
@@ -88,9 +85,9 @@
 and enjoy!
 </td></tr>
</table></div>
-<div class="important" title="Important"><table border="0" summary="Important">
+<div class="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>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Important]" src="../../../../../doc/src/images/important.png"></td>
<th align="left">Important</th>
</tr>
<tr><td align="left" valign="top">
@@ -102,7 +99,7 @@
 </td></tr>
</table></div>
<a name="boost_bimap.introduction.navigation"></a><h4>
-<a name="id554302"></a>
+<a name="id760051"></a>
 <a class="link" href="introduction.html#boost_bimap.introduction.navigation">Navigation</a>
 </h4>

@@ -111,72 +108,78 @@
 
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-General<div class="itemizedlist"><ul class="itemizedlist" type="circle">
+ General
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
<li class="listitem">
-<code class="literal">p</code> - Previous page
- </li>
+ <code class="literal">p</code> - Previous
+ page
+ </li>
<li class="listitem">
-<code class="literal">n</code> - Next page
- </li>
+ <code class="literal">n</code> - Next page
+ </li>
<li class="listitem">
-<code class="literal">h</code> - home
- </li>
+ <code class="literal">h</code> - home
+ </li>
<li class="listitem">
-<code class="literal">u</code> - Up
- </li>
+ <code class="literal">u</code> - Up
+ </li>
</ul></div>
-</li>
+ </li>
<li class="listitem">
-Main TOC<div class="itemizedlist"><ul class="itemizedlist" type="circle">
+ Main TOC
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
<li class="listitem">
-<code class="literal">i</code> - Introduction
- </li>
+ <code class="literal">i</code> - Introduction
+ </li>
<li class="listitem">
-<code class="literal">o</code> - One minute tutorial
- </li>
+ <code class="literal">o</code> - One minute
+ tutorial
+ </li>
<li class="listitem">
-<code class="literal">t</code> - The tutorial
- </li>
+ <code class="literal">t</code> - The tutorial
+ </li>
<li class="listitem">
-<code class="literal">b</code> - Bimap and Boost
- </li>
+ <code class="literal">b</code> - Bimap and
+ Boost
+ </li>
<li class="listitem">
-<code class="literal">r</code> - Reference
- </li>
+ <code class="literal">r</code> - Reference
+ </li>
<li class="listitem">
-<code class="literal">c</code> - Compiler specifics
- </li>
+ <code class="literal">c</code> - Compiler
+ specifics
+ </li>
<li class="listitem">
-<code class="literal">v</code> - Performance
- </li>
+ <code class="literal">v</code> - Performance
+ </li>
<li class="listitem">
-<code class="literal">e</code> - Examples
- </li>
+ <code class="literal">e</code> - Examples
+ </li>
<li class="listitem">
-<code class="literal">s</code> - Test Suite
- </li>
+ <code class="literal">s</code> - Test Suite
+ </li>
<li class="listitem">
-<code class="literal">f</code> - Future work
- </li>
+ <code class="literal">f</code> - Future work
+ </li>
<li class="listitem">
-<code class="literal">m</code> - Release notes
- </li>
+ <code class="literal">m</code> - Release notes
+ </li>
<li class="listitem">
-<code class="literal">w</code> - Rationale
- </li>
+ <code class="literal">w</code> - Rationale
+ </li>
<li class="listitem">
-<code class="literal">y</code> - History
- </li>
+ <code class="literal">y</code> - History
+ </li>
<li class="listitem">
-<code class="literal">a</code> - Acknowledgements
- </li>
+ <code class="literal">a</code> - Acknowledgements
+ </li>
</ul></div>
-</li>
+ </li>
</ul></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -184,7 +187,7 @@
</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>
+<a accesskey="p" href="../index.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="one_minute_tutorial.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>One minute tutorial</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<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="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">
</head>
@@ -13,21 +13,21 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="introduction.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="the_tutorial.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="One minute tutorial">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<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="id554565"></a>
+<a name="id760382"></a>
 <a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.what_is_a_bimap_">What is a
 bimap?</a>
 </h4>
@@ -51,20 +51,19 @@
</pre>

 Given this code, the following is the complete description of the resulting
- bimap.
- [<a name="id554727" href="#ftn.id554727" class="footnote">1</a>]
+ bimap. [<a name="id760544" href="#ftn.id760544" class="footnote">1</a>]
 
<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>
+ <code class="computeroutput">bm.left</code> is signature-compatible with <code class="computeroutput">std::map<X,Y></code>
+ </li>
<li class="listitem">
-<code class="computeroutput">bm.right</code> is signature-compatible with <code class="computeroutput">std::map<Y,X></code>
-</li>
+ <code class="computeroutput">bm.right</code> is signature-compatible with <code class="computeroutput">std::map<Y,X></code>
+ </li>
<li class="listitem">
-<code class="computeroutput">bm</code> is signature-compatible
- with <code class="computeroutput">std::set< relation<X,Y> ></code>
-</li>
+ <code class="computeroutput">bm</code> is signature-compatible
+ with <code class="computeroutput">std::set< relation<X,Y> ></code>
+ </li>
</ul></div>

 <img src="../images/bimap/simple.bimap.png" alt="simple.bimap">
@@ -106,7 +105,7 @@
...
</pre>
<a name="boost_bimap.one_minute_tutorial.layout_of_the_relation_and_the_pairs_of_a_bimap"></a><h4>
-<a name="id555399"></a>
+<a name="id761226"></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>
@@ -120,7 +119,7 @@
 <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="id555466"></a>
+<a name="id761293"></a>
 <a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.step_by_step">Step by step</a>
 </h4>

@@ -132,19 +131,15 @@
 Lets define a bidirectional map between integers and strings:
 

- 
-
-
+

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

- 
-
 
<a name="boost_bimap.one_minute_tutorial.the_collection_of_relations_view"></a><h4>
-<a name="id555616"></a>
+<a name="id761439"></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>
@@ -154,9 +149,7 @@
 using this view.
 

- 
-
-
+

<pre class="programlisting">bm.insert( bm_type::value_type(1, "one" ) );
bm.insert( bm_type::value_type(2, "two" ) );
@@ -173,11 +166,9 @@
}
</pre>

- 
-
 
<a name="boost_bimap.one_minute_tutorial.the_left_map_view"></a><h4>
-<a name="id556065"></a>
+<a name="id761885"></a>
 <a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.the_left_map_view">The left
 map view</a>
 </h4>
@@ -188,11 +179,9 @@
 use a standard map.
 

- 
-
-
+

-<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;
+<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 )
@@ -203,41 +192,38 @@
 std::cout << left_iter->first << " --> " << left_iter->second << std::endl;
}

-<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);
+<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 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" ) );
+<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>

- 
+ 

 
-
- 
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
<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>
+ 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 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>
+ 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 valign="top" align="left"> This line produces the same effect
- of <code class="computeroutput">bm.insert( bm_type::value_type(3,"three") );</code> </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>
</table></div>

- 
-
 
<a name="boost_bimap.one_minute_tutorial.the_right_map_view"></a><h4>
-<a name="id556790"></a>
+<a name="id762598"></a>
 <a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.the_right_map_view">The right
 map view</a>
 </h4>
@@ -248,9 +234,7 @@
 one, exactly as with standard maps.
 

- 
-
-
+

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

@@ -263,25 +247,21 @@

bm.right.erase("two");

-<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 ) );
+<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>

- 
+ 

 
-
- 
<div class="calloutlist"><table border="0" summary="Callout list"><tr>
<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>
+<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>

- 
-
 
<a name="boost_bimap.one_minute_tutorial.differences_with_std__map"></a><h4>
-<a name="id557230"></a>
+<a name="id763032"></a>
 <a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.differences_with_std__map">Differences
 with std::map</a>
 </h4>
@@ -312,7 +292,7 @@
assert( bm.size() == 1 );
</pre>
<a name="boost_bimap.one_minute_tutorial.a_simple_example"></a><h4>
-<a name="id557889"></a>
+<a name="id763691"></a>
 <a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.a_simple_example">A simple example</a>
 </h4>

@@ -323,9 +303,7 @@
 <a href="../../../example/simple_bimap.cpp" target="_top">Go to source code</a>
 

- 
-
-
+

<pre class="programlisting">#include <string>
#include <iostream>
@@ -385,8 +363,6 @@
}
</pre>

- 
-
 

 The output of this program will be the following:
@@ -408,7 +384,7 @@
<code class="literal">Spain ends in position 2</code>
</pre>
<a name="boost_bimap.one_minute_tutorial.continuing_the_journey"></a><h4>
-<a name="id559435"></a>
+<a name="id764963"></a>
 <a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.continuing_the_journey">Continuing
 the journey</a>
 </h4>
@@ -417,9 +393,9 @@
 or read the <a class="link" href="reference.html" title="Reference">reference</a> section
 of this documentation.
 
-<div class="caution" title="Caution"><table border="0" summary="Caution">
+<div class="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>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Caution]" src="../../../../../doc/src/images/caution.png"></td>
<th align="left">Caution</th>
</tr>
<tr><td align="left" valign="top">
@@ -434,16 +410,16 @@
</table></div>
<div class="footnotes">
 <hr width="100" align="left">
-<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.
- </div>
+<div class="footnote">[<a name="ftn.id760544" href="#id760544" 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.
+ </div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -451,7 +427,7 @@
</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>
+<a accesskey="p" href="introduction.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="the_tutorial.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Performance</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<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="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">
</head>
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="compiler_specifics.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="examples.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Performance">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="boost_bimap.performance"></a><a class="link" href="performance.html" title="Performance">Performance</a>
</h2></div></div></div>
@@ -32,7 +32,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -40,7 +40,7 @@
</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>
+<a accesskey="p" href="compiler_specifics.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="examples.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Rationale</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<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="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">
</head>
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="release_notes.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rationale/additional_features.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Rationale">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="boost_bimap.rationale"></a><a class="link" href="rationale.html" title="Rationale">Rationale</a>
</h2></div></div></div>
@@ -46,9 +46,9 @@
 of email flowed between Joaquin and Matias. The juiciest parts of the conversations
 where extracted and rearranged here.
 
-<div class="note" title="Note"><table border="0" summary="Note">
+<div class="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>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
<tr><td align="left" valign="top">
@@ -57,7 +57,7 @@
 at developers.
 </td></tr>
</table></div>
-<div class="section" title="General Design">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<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>
@@ -133,17 +133,17 @@
 
<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>
+ <code class="computeroutput">bm.left</code> is signature-compatible with a
+ <code class="computeroutput">std::map<A,B></code>
+ </li>
<li class="listitem">
-<code class="computeroutput">bm.right</code> is signature-compatible with a
- <code class="computeroutput">std::map<B,A></code>
-</li>
+ <code class="computeroutput">bm.right</code> is signature-compatible with
+ a <code class="computeroutput">std::map<B,A></code>
+ </li>
<li class="listitem">
-<code class="computeroutput">bm</code> is signature-compatible
- with a <code class="computeroutput">std::set<relation<A,B> ></code>
-</li>
+ <code class="computeroutput">bm</code> is signature-compatible
+ with a <code class="computeroutput">std::set<relation<A,B> ></code>
+ </li>
</ol></div>

 <img src="../images/bimap/simple.bimap.png" alt="simple.bimap">
@@ -153,7 +153,7 @@
 as being simple and powerful. This is the general design.
 
<a name="boost_bimap.rationale.general_design.relation_implementation"></a><h5>
-<a name="id666407"></a>
+<a name="id874221"></a>
 <a class="link" href="rationale.html#boost_bimap.rationale.general_design.relation_implementation">Relation
 Implementation</a>
 </h5>
@@ -242,9 +242,9 @@
 both cases, because we require that the same code be compilable by any standards-compliant
 compiler.
 
-<div class="note" title="Note"><table border="0" summary="Note">
+<div class="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>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
<tr><td align="left" valign="top">
@@ -254,7 +254,7 @@
 </td></tr>
</table></div>
<a name="boost_bimap.rationale.general_design.bimap_implementation"></a><h5>
-<a name="id666981"></a>
+<a name="id874795"></a>
 <a class="link" href="rationale.html#boost_bimap.rationale.general_design.bimap_implementation">Bimap
 Implementation</a>
 </h5>
@@ -284,7 +284,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -292,7 +292,7 @@
</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>
+<a accesskey="p" href="release_notes.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rationale/additional_features.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Additional Features</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<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,22 +13,22 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="../rationale.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="code.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Additional Features">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<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="id667261"></a>
+<a name="id875074"></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,13 +42,13 @@
 
<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 class="listitem">
- The map views now change their semantics according to the collection type
- chosen.
- </li>
+ 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 class="listitem">
+ The map views now change their semantics according to the collection
+ type chosen.
+ </li>
</ul></div>

 Boost.Bimap relies heavily on Boost.MPL to implement all of the metaprogramming
@@ -60,7 +60,7 @@
 <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="id667368"></a>
+<a name="id875189"></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 +74,29 @@
 
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- left_based
- </li>
+ left_based
+ </li>
<li class="listitem">
- right_based
- </li>
+ right_based
+ </li>
<li class="listitem">
- set_of_relation<>
- </li>
+ set_of_relation<>
+ </li>
<li class="listitem">
- multiset_of_relation<>
- </li>
+ multiset_of_relation<>
+ </li>
<li class="listitem">
- unordered_set_of_relation<>
- </li>
+ unordered_set_of_relation<>
+ </li>
<li class="listitem">
- unordered_multiset_of_relation<>
- </li>
+ unordered_multiset_of_relation<>
+ </li>
<li class="listitem">
- list_of
- </li>
+ list_of
+ </li>
<li class="listitem">
- vector_of
- </li>
+ vector_of
+ </li>
</ul></div>

 In the first two cases, there are only two indices in the <code class="computeroutput">multi_index_core</code>,
@@ -104,7 +104,7 @@
 uses further metaprogramming to define a new index if necessary.
 
<a name="boost_bimap.rationale.additional_features.tagged"></a><h5>
-<a name="id667455"></a>
+<a name="id875302"></a>
 <a class="link" href="additional_features.html#boost_bimap.rationale.additional_features.tagged">Tagged</a>
 </h5>

@@ -125,7 +125,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -133,7 +133,7 @@
</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>
+<a accesskey="p" href="../rationale.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="code.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Code</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<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">
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="additional_features.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="the_student_and_the_mentor.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Code">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.rationale.code"></a><a class="link" href="code.html" title="Code">Code</a>
</h3></div></div></div>
@@ -34,7 +34,7 @@
 Library Requirement and Guidelines</a> as closely as possible.
 
<div class="table">
-<a name="id667570"></a>Table 1.10. folders in boost/bimap
+<a name="id875417"></a>Table 1.10. folders in boost/bimap
<div class="table-contents"><table class="table" summary="folders in boost/bimap">
<colgroup>
<col>
@@ -42,90 +42,90 @@
</colgroup>
<thead><tr>
<th>
- 
- name
- 
- </th>
+ 
+ name
+ 
+ </th>
<th>
- 
- what is inside?
- 
- </th>
+ 
+ what is inside?
+ 
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- user level header files
- 
- </td>
-<td class="auto-generated"> </td>
+ 
+ user level header files
+ 
+ </td>
+<td class="auto-generated"> </td>
</tr>
<tr>
<td>
- 
- tagged/
- 
- </td>
+ 
+ tagged/
+ 
+ </td>
<td>
- 
- tagged idiom
- 
- </td>
+ 
+ tagged idiom
+ 
+ </td>
</tr>
<tr>
<td>
- 
- relation/
- 
- </td>
+ 
+ relation/
+ 
+ </td>
<td>
- 
- the bimap data
- 
- </td>
+ 
+ the bimap data
+ 
+ </td>
</tr>
<tr>
<td>
- 
- container_adaptor/
- 
- </td>
+ 
+ container_adaptor/
+ 
+ </td>
<td>
- 
- easy way of adapting containers
- 
- </td>
+ 
+ easy way of adapting containers
+ 
+ </td>
</tr>
<tr>
<td>
- 
- views/
- 
- </td>
+ 
+ views/
+ 
+ </td>
<td>
- 
- bimap views
- 
- </td>
+ 
+ bimap views
+ 
+ </td>
</tr>
<tr>
<td>
- 
- property_map/
- 
- </td>
+ 
+ property_map/
+ 
+ </td>
<td>
- 
- support for property map concept
- 
- </td>
+ 
+ support for property map concept
+ 
+ </td>
</tr>
</tbody>
</table></div>
</div>
 <div class="table">
-<a name="id667700"></a>Table 1.11. folders in each folder
+<a name="id875556"></a>Table 1.11. folders in each folder
<div class="table-contents"><table class="table" summary="folders in each folder">
<colgroup>
<col>
@@ -133,51 +133,49 @@
</colgroup>
<thead><tr>
<th>
- 
- name
- 
- </th>
+ 
+ name
+ 
+ </th>
<th>
- 
- what is inside?
- 
- </th>
+ 
+ what is inside?
+ 
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- 
- </td>
+ </td>
<td>
- 
- class definitions
- 
- </td>
+ 
+ class definitions
+ 
+ </td>
</tr>
<tr>
<td>
- 
- support/
- 
- </td>
+ 
+ support/
+ 
+ </td>
<td>
- 
- optional metafunctions and free functions
- 
- </td>
+ 
+ optional metafunctions and free functions
+ 
+ </td>
</tr>
<tr>
<td>
- 
- detail/
- 
- </td>
+ 
+ detail/
+ 
+ </td>
<td>
- 
- things not intended for the user's eyes
- 
- </td>
+ 
+ things not intended for the user's eyes
+ 
+ </td>
</tr>
</tbody>
</table></div>
@@ -186,7 +184,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -194,7 +192,7 @@
</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>
+<a accesskey="p" href="additional_features.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="the_student_and_the_mentor.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>The student and the mentor</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<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 +13,23 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="code.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../history.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="The student and the mentor">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<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" title="Tip"><table border="0" summary="Tip">
+<div class="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>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Tip]" src="../../../../../../doc/src/images/tip.png"></td>
<th align="left">Tip</th>
</tr>
<tr><td align="left" valign="top">
@@ -37,345 +37,197 @@
 SoC proposal</a> first.
 </td></tr>
</table></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- <code class="literal">- The discussion starts with Joaquin trying to strip out the
- "misc" name out of the library -</code>
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ <code class="literal">- The discussion starts with Joaquin trying to strip out the "misc"
+ name out of the library -</code>
+ </blockquote></div>

 <img src="../../images/people/joaquin.png" alt="joaquin">
 

 Joaquin
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Thinking about it, the unifying principle of MISC containers
- is perhaps misleading: certainly all miscs use multi-indexing internally,
- but this does not reflect much in the external interface (as it should
- be, OTOH). So, from the user's point of view, miscs are entirely heterogeneous
- beasts. Moreover, there isn't in your proposal any kind of global facility
- common to all miscs. What about dropping the misc principle and working
- on each container as a separate library, then? You'd have boost::bimap,
- boost::mru, etc, and no common intro to them. This also opens up the
- possibility to add other containers to the suite which aren't based on
- B.MI. What's your stance on this? Do you see a value in keeping miscs
- conceptually together? 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Thinking about it, the unifying principle of MISC containers
+ is perhaps misleading: certainly all miscs use multi-indexing internally,
+ but this does not reflect much in the external interface (as it should
+ be, OTOH). So, from the user's point of view, miscs are entirely heterogeneous
+ beasts. Moreover, there isn't in your proposal any kind of global facility
+ common to all miscs. What about dropping the misc principle and working
+ on each container as a separate library, then? You'd have boost::bimap,
+ boost::mru, etc, and no common intro to them. This also opens up the possibility
+ to add other containers to the suite which aren't based on B.MI. What's
+ your stance on this? Do you see a value in keeping miscs conceptually together?
+ 
+ </blockquote></div>

 <img src="../../images/people/matias.png" alt="matias">
 

 Matias
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- As the original proposal states only two containers (bimap
- and mru set) both based in B.MI, it was straight forward to group them
- together. When I was writing the SoC proposal I experienced a similar
- feeling when the two families begin to grow. As you say, the only common
- denominator is their internal implementation. I thought a bit about a
- more general framework to join this two families (and other internally
- related ones) and finally came up with an idea: Boost.MultiIndex! So
- I think that it is not a good idea to try to unify the two families and
- I voted in favor of get rid of the misc part of boost::misc::bimap and
- boost::misc::mru. Anyway, for my SoC application it seems OK to put the
- two families in the same project because although from the outside they
- are completely unrelated, the work I will have to do in order to build
- the libraries will be consistent and what I will learn coding the bimap
- family will be used when I start to code the mru family. When the mru
- family is in place, I will surely have learnt other things to improve
- the bimap group. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- On the other hand, I think it will be useful for the general
- user to have at least some document linked in the B.MI documentation
- that enumerates the most common cases of uses (a bimap and an mru set
- for example) and points where to find clean implementation for this useful
- containers. For now, a link to boost::bimap and other one to boost::mru
- will suffice. If you think about the title of such a document, you will
- probably come up with something like: Common Multi Index Specialized
- Containers, and we are back to our misc proposal. So, to order some ideas:
- 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - A new family of containers that can be accessed by both key
- will be created. (boost::bimap)
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - A new family of time aware containers will see the light.
- (boost::mru)
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - A page can be added to B.MI documentation, titled misc that
- links this new libraries.
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- This is a clearer framework for the user. They can use a mru
- container without hearing about Boost.MultiIndex at all. And B.MI users
- will get some of their common containers already implemented with an
- STL friendly interface in other libraries. And as you stated this is
- more extensible because opens the door to use other libraries in bimap
- and mru families than just Boost.MultiIndex without compromising the
- more general boost framework. The word "misc" it is going to
- disappear from the code and the documentation of bimap and mru. From
- now on the only use for it will be to identify our SoC project. I am
- thinking in a name for the bimap library. What about Boost.BidirectionalMap?
- Ideas? 
- 
-
- 
-</blockquote></div>
-
- Joaquin
- 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Yes, Boost.Bimap. In my opinion, bimap is a well known name
- in the Boost and even in the C++ community. It sounds and is short. Why
- not to vindicate yourself as the owner of this name? 
- 
-
- 
-</blockquote></div>
-
- <code class="literal">- Then after a week of work -</code>
- 
-
- Matias
- 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Now that Boost.Bimap is getting some shape, I see that as
- you have told me, we must offer a "one_to_many_map" and a "multi_bimap"
- as part of the library. The framework I am actually working allowed to
- construct this kind of bidirectional maps and it is easy to understand
- from the user side. 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ As the original proposal states only two containers (bimap and
+ mru set) both based in B.MI, it was straight forward to group them together.
+ When I was writing the SoC proposal I experienced a similar feeling when
+ the two families begin to grow. As you say, the only common denominator
+ is their internal implementation. I thought a bit about a more general
+ framework to join this two families (and other internally related ones)
+ and finally came up with an idea: Boost.MultiIndex! So I think that it
+ is not a good idea to try to unify the two families and I voted in favor
+ of get rid of the misc part of boost::misc::bimap and boost::misc::mru.
+ Anyway, for my SoC application it seems OK to put the two families in the
+ same project because although from the outside they are completely unrelated,
+ the work I will have to do in order to build the libraries will be consistent
+ and what I will learn coding the bimap family will be used when I start
+ to code the mru family. When the mru family is in place, I will surely
+ have learnt other things to improve the bimap group. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ On the other hand, I think it will be useful for the general
+ user to have at least some document linked in the B.MI documentation that
+ enumerates the most common cases of uses (a bimap and an mru set for example)
+ and points where to find clean implementation for this useful containers.
+ For now, a link to boost::bimap and other one to boost::mru will suffice.
+ If you think about the title of such a document, you will probably come
+ up with something like: Common Multi Index Specialized Containers, and
+ we are back to our misc proposal. So, to order some ideas: 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - A new family of containers that can be accessed by both key
+ will be created. (boost::bimap)
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - A new family of time aware containers will see the light. (boost::mru)
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - A page can be added to B.MI documentation, titled misc that
+ links this new libraries.
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ This is a clearer framework for the user. They can use a mru
+ container without hearing about Boost.MultiIndex at all. And B.MI users
+ will get some of their common containers already implemented with an STL
+ friendly interface in other libraries. And as you stated this is more extensible
+ because opens the door to use other libraries in bimap and mru families
+ than just Boost.MultiIndex without compromising the more general boost
+ framework. The word "misc" it is going to disappear from the
+ code and the documentation of bimap and mru. From now on the only use for
+ it will be to identify our SoC project. I am thinking in a name for the
+ bimap library. What about Boost.BidirectionalMap? Ideas? 
+ </blockquote></div>

 Joaquin
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- OK, I am glad we agree on this point. 
- 
+<div class="blockquote"><blockquote class="blockquote">
+ Yes, Boost.Bimap. In my opinion, bimap is a well known name
+ in the Boost and even in the C++ community. It sounds and is short. Why
+ not to vindicate yourself as the owner of this name? 
+ </blockquote></div>

- 
-</blockquote></div>
-
- Matias
- 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- With respect to the symmetry of the key access names, I have
- to agree that there is not much a difference between the following ones:
- 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - to - from
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - to - b
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - 0 - 1
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - left - right
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- In my opinion it is a matter of taste, but left/right sounds
- more symmetrical than the others. 
- 
-
- 
-</blockquote></div>
-
- Joaquin
- 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- I like very much the left/right notation, it is very simple
- to remember and it is a lot more symmetrical than to/from. 
- 
-
- 
-</blockquote></div>
-
- Matias
+ <code class="literal">- Then after a week of work -</code>
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- At first my idea was to obtain ease of use hiding the B.MI
- core, making it more STL-intuitive. Nevertheless I have realized that
- B.MI is a lot more coherent and easy to use that I had imagined. This
- makes me think again in the problem. In the design that I am coding now,
- bimap is-a multi_index_container specializes
- with a data type very comfortable called bipair, that can be seen like
- any of the two maps that integrates it using map views. This scheme has
- great benefits for users: 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - If the user already knows B.MI, he can take advantage of
- the tools that it provides and that are not present in the STL containers.
- In addition, in some cases the use to indices to see the data can be
- very useful. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - If the user does not know anything about B.MI but have an
- STL framework, the learning curve is reduced to understand the bimap
- instantiation and how a is obtained the desired map view. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Another very important benefit holds: All the algorithms done
- for B.MI continues to work with Boost.Bimap and if B.MI continues growing,
- bimap grow automatically. 
- 
-
- 
-</blockquote></div>
-
- Joaquin
- 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Umm... This is an interesting design decision, but controversial
- in my opinion. Basically you decide to expose the implementation of bimap;
- that has advantages, as you stated, but also a nonsmall disadvantage:
- once you have documented the implementation,
- it is not possible to change it anymore. It is a marriage with B.MI without
- the chance of divorce. The other possibility, to hide the implementation
- and to duplicate and document the provided functionality, explicitly
- or implicitly due to the same characteristics of the implementation,
- is of course heavier to maintain, but it gives a degree of freedom to
- change the guts of your software if you need to. Do not take this like
- a frontal objection, but I think that it is quite important design decision,
- not only in the context of bimap but in general. 
- 
-
- 
-</blockquote></div>

 Matias
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- You are quite right here. I think we have to choose the hardest
- path and hide the B.MI core from the user. I am sending you the first
- draft of bimap along with some documentation. 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Now that Boost.Bimap is getting some shape, I see that as you
+ have told me, we must offer a "one_to_many_map" and a "multi_bimap"
+ as part of the library. The framework I am actually working allowed to
+ construct this kind of bidirectional maps and it is easy to understand
+ from the user side. 
+ </blockquote></div>
+
+ Joaquin
+ 
+<div class="blockquote"><blockquote class="blockquote">
+ OK, I am glad we agree on this point. 
+ </blockquote></div>
+
+ Matias
+ 
+<div class="blockquote"><blockquote class="blockquote">
+ With respect to the symmetry of the key access names, I have
+ to agree that there is not much a difference between the following ones:
+ 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - to - from
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - to - b
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - 0 - 1
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - left - right
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ In my opinion it is a matter of taste, but left/right sounds
+ more symmetrical than the others. 
+ </blockquote></div>
+
+ Joaquin
+ 
+<div class="blockquote"><blockquote class="blockquote">
+ I like very much the left/right notation, it is very simple
+ to remember and it is a lot more symmetrical than to/from. 
+ </blockquote></div>
+
+ Matias
+ 
+<div class="blockquote"><blockquote class="blockquote">
+ At first my idea was to obtain ease of use hiding the B.MI core,
+ making it more STL-intuitive. Nevertheless I have realized that B.MI is
+ a lot more coherent and easy to use that I had imagined. This makes me
+ think again in the problem. In the design that I am coding now, bimap
+ is-a multi_index_container specializes
+ with a data type very comfortable called bipair, that can be seen like
+ any of the two maps that integrates it using map views. This scheme has
+ great benefits for users: 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - If the user already knows B.MI, he can take advantage of the
+ tools that it provides and that are not present in the STL containers.
+ In addition, in some cases the use to indices to see the data can be very
+ useful. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - If the user does not know anything about B.MI but have an
+ STL framework, the learning curve is reduced to understand the bimap instantiation
+ and how a is obtained the desired map view. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Another very important benefit holds: All the algorithms done
+ for B.MI continues to work with Boost.Bimap and if B.MI continues growing,
+ bimap grow automatically. 
+ </blockquote></div>
+
+ Joaquin
+ 
+<div class="blockquote"><blockquote class="blockquote">
+ Umm... This is an interesting design decision, but controversial
+ in my opinion. Basically you decide to expose the implementation of bimap;
+ that has advantages, as you stated, but also a nonsmall disadvantage: once
+ you have documented the implementation,
+ it is not possible to change it anymore. It is a marriage with B.MI without
+ the chance of divorce. The other possibility, to hide the implementation
+ and to duplicate and document the provided functionality, explicitly or
+ implicitly due to the same characteristics of the implementation, is of
+ course heavier to maintain, but it gives a degree of freedom to change
+ the guts of your software if you need to. Do not take this like a frontal
+ objection, but I think that it is quite important design decision, not
+ only in the context of bimap but in general. 
+ </blockquote></div>
+
+ Matias
+ 
+<div class="blockquote"><blockquote class="blockquote">
+ You are quite right here. I think we have to choose the hardest
+ path and hide the B.MI core from the user. I am sending you the first draft
+ of bimap along with some documentation. 
+ </blockquote></div>

 <code class="literal">- This completes the second week, the documentation was basically
 the first section of this rationale -</code>
@@ -383,371 +235,195 @@

 Joaquin
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- I must confess that I am beginning to like what I see. I am
- mathematical by vocation, and when I see symmetry in a formulation I
- believe that it is in the right track. 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ I must confess that I am beginning to like what I see. I am
+ mathematical by vocation, and when I see symmetry in a formulation I believe
+ that it is in the right track. 
+ </blockquote></div>

 Matias
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- We are two mathematicians by vocation then. 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ We are two mathematicians by vocation then. 
+ </blockquote></div>

 Joaquin
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- I think that the part of std::set theory is very clear. To
- me, it turns out to me somewhat strange to consider the rank of a map
- (values X) like a std::set, but of course the formulation is consistent.
- 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ I think that the part of std::set theory is very clear. To me,
+ it turns out to me somewhat strange to consider the rank of a map (values
+ X) like a std::set, but of course the formulation is consistent. 
+ </blockquote></div>

 Matias
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- I like it very much, it can be a little odd at first, but
- now that I have get used to it, it is very easy to express in the code
- my contrains on the data, and I believe that if somebody reads the code
- and sees the bimap instantiation he is not going to have problems understanding
- it. Perhaps it is easier to understand it if we use your notation: ordered_nonunique,
- unordered_unique, but this goes against our STL facade. In my opinion
- the user that comes from STL must have to learn as less as possible.
- 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ I like it very much, it can be a little odd at first, but now
+ that I have get used to it, it is very easy to express in the code my contrains
+ on the data, and I believe that if somebody reads the code and sees the
+ bimap instantiation he is not going to have problems understanding it.
+ Perhaps it is easier to understand it if we use your notation: ordered_nonunique,
+ unordered_unique, but this goes against our STL facade. In my opinion the
+ user that comes from STL must have to learn as less as possible. 
+ </blockquote></div>

 Joaquin
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Considering a relation like a <code class="computeroutput">struct
- {left, right}</code> is clean and clear. If I understand
- it well, one relation has views of type <code class="computeroutput">pair{first, second}</code>, is this correct? 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Considering a relation like a <code class="computeroutput">struct
+ {left, right}</code> is clean and clear. If I understand it
+ well, one relation has views of type <code class="computeroutput">pair{first, second}</code>, is this correct? 
+ </blockquote></div>

 Matias
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Yes, I believe that the left/right notation to express symmetry
- is great. I believe that to people is going to love it. 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Yes, I believe that the left/right notation to express symmetry
+ is great. I believe that to people is going to love it. 
+ </blockquote></div>

 Joaquin
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- OK, perfect. I likes this very much: 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - bm.left is compatible with std::map<A,B>
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - bm.right is compatible with std::map<B,A>
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - bm is compatible with std::set<relation<A,B>>
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- It is elegant and symmetric. I feel good vibrations here.
- 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ OK, perfect. I likes this very much: 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - bm.left is compatible with std::map<A,B>
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - bm.right is compatible with std::map<B,A>
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - bm is compatible with std::set<relation<A,B>>
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ It is elegant and symmetric. I feel good vibrations here. 
+ </blockquote></div>

 Matias
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Great! 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Great! 
+ </blockquote></div>

 Joaquin
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Moving on, the support for N-1, N-N, and hashed index is very
- easy to grasp, and it fits well in framework. However I do not finish
- to understand very well the "set<relation> constraints"
- section. Will you came up with some examples of which is the meaning
- of the different cases that you enumerate? 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Moving on, the support for N-1, N-N, and hashed index is very
+ easy to grasp, and it fits well in framework. However I do not finish to
+ understand very well the "set<relation> constraints" section.
+ Will you came up with some examples of which is the meaning of the different
+ cases that you enumerate? 
+ </blockquote></div>

 Matias - 
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Yes, I mean: 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - based on the left
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - based on the right
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- The bimap core must be based on some index of multi index.
- If the index of the left is of the type hash, then in fact the main view
- is going to be an unordered_set< relation<A,B> >. Perhaps
- this is not what the user prefers and he wants to base its main view
- on the right index. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - set_of_relation 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - multiset_of_relation 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - unordered_set_of_relation 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - unordered_multiset_of_relation 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- However, if both of them are hash indexes, the user may want
- the main view to be ordered. As we have a B.MI core this is very easy
- to support, we just have to add another index to it. 
- 
-
- 
-</blockquote></div>
-
- Joaquin
- 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- I understand it now. OK, I do not know if we have to include
- this in the first version, is going to be a functionality avalanche!
- 
- 
-
- 
-</blockquote></div>
-
- Matias
- 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- The user is not affected by the addition of this functionality,
- because by default it will be based on the left index that is a very
- natural behaviour. I do not think that this is functionality bloat, but
- I agree with you that it is a functionality avalanche. 
- 
-
- 
-</blockquote></div>
-
- Joaquin
- 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- There are restrictions between the left and right set types
- and the possible main view set types. For example if some of the index
- is of unique type, then the main view cannot be of type multiset_of_relation.
- To the inverse one, if the main view is of type set_of_relation the left
- and the right index cannot be of type multi_set. All this subject of
- the unicity constrictions and the resulting interactions between indexes
- is one of the subtle subjects of B.MI. 
- 
-
- 
-</blockquote></div>
-
- Matias
- 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- This can be checked at compile time and informed as an error
- in compile time. 
- 
-
- 
-</blockquote></div>
-
- Joaquin
- 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- It can be interesting. 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Yes, I mean: 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - based on the left
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - based on the right
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ The bimap core must be based on some index of multi index. If
+ the index of the left is of the type hash, then in fact the main view is
+ going to be an unordered_set< relation<A,B> >. Perhaps this
+ is not what the user prefers and he wants to base its main view on the
+ right index. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - set_of_relation 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - multiset_of_relation 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - unordered_set_of_relation 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - unordered_multiset_of_relation 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ However, if both of them are hash indexes, the user may want
+ the main view to be ordered. As we have a B.MI core this is very easy to
+ support, we just have to add another index to it. 
+ </blockquote></div>
+
+ Joaquin
+ 
+<div class="blockquote"><blockquote class="blockquote">
+ I understand it now. OK, I do not know if we have to include
+ this in the first version, is going to be a functionality avalanche! 
+ </blockquote></div>
+
+ Matias
+ 
+<div class="blockquote"><blockquote class="blockquote">
+ The user is not affected by the addition of this functionality,
+ because by default it will be based on the left index that is a very natural
+ behaviour. I do not think that this is functionality bloat, but I agree
+ with you that it is a functionality avalanche. 
+ </blockquote></div>
+
+ Joaquin
+ 
+<div class="blockquote"><blockquote class="blockquote">
+ There are restrictions between the left and right set types
+ and the possible main view set types. For example if some of the index
+ is of unique type, then the main view cannot be of type multiset_of_relation.
+ To the inverse one, if the main view is of type set_of_relation the left
+ and the right index cannot be of type multi_set. All this subject of the
+ unicity constrictions and the resulting interactions between indexes is
+ one of the subtle subjects of B.MI. 
+ </blockquote></div>
+
+ Matias
+ 
+<div class="blockquote"><blockquote class="blockquote">
+ This can be checked at compile time and informed as an error
+ in compile time. 
+ </blockquote></div>
+
+ Joaquin
+ 
+<div class="blockquote"><blockquote class="blockquote">
+ It can be interesting. 
+ </blockquote></div>

 <code class="literal">- And right when everything seems to be perfect... - </code>
 

 Joaquin
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- I have some worse news with respect to mutant, it is very
- a well designed and manageable class, unfortunately, C++ does not guarantee
- layout-compatibility almost in any case. For example, the C++ standard
- does not guarantee that the classes <code class="computeroutput">struct{T1 a; T2 b;}</code> and <code class="computeroutput">struct{T1 b; T2 a;}</code> are layout-compatible, and therefore
- the trick of reinterpret_cast is an undefined behavior. I am with you
- in which that in the 100% of the cases this scheme will really work,
- but the standard is the standard. If you can look the layout-compatibility
- subject in it (http://www.kuzbass.ru/docs class="emphasis">isocpp).
- As you see, sometimes the standard is cruel. Although mutant seems a
- lost case, please do not hurry to eliminate it. We will see what can
- be done for it. 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ I have some worse news with respect to mutant, it is very a
+ well designed and manageable class, unfortunately, C++ does not guarantee
+ layout-compatibility almost in any case. For example, the C++ standard
+ does not guarantee that the classes <code class="computeroutput">struct{T1 a; T2
+ b;}</code>
+ and <code class="computeroutput">struct{T1 b; T2 a;}</code> are
+ layout-compatible, and therefore the trick of reinterpret_cast is an undefined
+ behavior. I am with you in which that in the 100% of the cases this scheme
+ will really work, but the standard is the standard. If you can look the
+ layout-compatibility subject in it (http://www.kuzbass.ru/docs class="emphasis">isocpp).
+ As you see, sometimes the standard is cruel. Although mutant seems a lost
+ case, please do not hurry to eliminate it. We will see what can be done
+ for it. 
+ </blockquote></div>

 Matias
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- I read the standard, and you were right about it. Mutant was
- an implementation detail. It is a pity because I am sure that it will
- work perfect in any compiler. Perhaps the standard becomes more strict
- some day and mutant returns to life... We can then try a wrapper around
- a relation<A,B> that have two references named first and second
- that bind to A and B, or B and A. 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ I read the standard, and you were right about it. Mutant was
+ an implementation detail. It is a pity because I am sure that it will work
+ perfect in any compiler. Perhaps the standard becomes more strict some
+ day and mutant returns to life... We can then try a wrapper around a relation<A,B>
+ that have two references named first and second that bind to A and B, or
+ B and A. 
+ </blockquote></div>



@@ -757,537 +433,278 @@
</pre>

 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- It is not difficult to code the relation class in this way
- but two references are initialized with every access and the use of
- <code class="computeroutput">pba.first</code> will be slower than <code class="computeroutput">r.left</code> in most compilers. It is very
- difficult to optimize this kind of references. 
- 
-
- 
-</blockquote></div>
-
- Joaquin
- 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- This workaround is not possible, due to technical problems
- with the expected behavior of the iterators. If the iterators of bm.left
- are of bidirectional type, then standard stated that it have to return
- an object of type const value_type& when dereferenced. You will have
- to return a const_reference_pair created in the flight, making it impossible
- to return a reference. 
- 
-
- 
-</blockquote></div>
-
- Matias
- 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- I understand... I have workaround for that also but surely
- the standard will attack me again! We must manage to create the class
- relation that responds as we want, the rest of the code will flow from
- this point. This clear separation between the relation class and the
- rest of the library, is going to help to us to separate the problems
- and to attack them better. 
- 
-
- 
-</blockquote></div>
-
- Joaquin
- 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- What workaround? It already pricks my curiosity,I have dedicated
- a long time to the subject and I do not find any solution except that
- we allow the relation class to occupy more memory. 
- 
-
- 
-</blockquote></div>
-
- Matias
- 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- We must achieve that the relation<A,B> size equals the
- pair<A,B> size if we want this library to be really useful. I was
- going to write my workaround and I realized that It does not work. Look
- at this: http://www.boost.org/libs/iterator/doc/new-iter-concepts.html
- Basically the problem that we are dealing is solved if we based our iterators
- on this proposal. The present standard forces that the bidirectional
- iterators also are of the type input and output. Using the new concepts
- there is no inconvenient in making our iterators "Readable Writable
- Swappable Bidirectional Traversal". Therefore the const_reference_pair
- returns to be valid. 
- 
-
- 
-</blockquote></div>
-
- Joaquin
- 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- It is correct in the sense that you simply say that your iterators
- are less powerful than those of the std::map. It is not that it is wrong,
- simply that instead of fixing the problem, you confess it. 
- 
-
- 
-</blockquote></div>
-
- Matias
- 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- OK, but in our particular case; What are the benefits of offering
- a LValue iterator against a Read Write iterator? It does not seem to
- me that it is less powerful in this case. 
- 
-
- 
-</blockquote></div>
-
- Joaquin
- 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- The main problem with a ReadWrite is that the following thing:
- <code class="computeroutput">value_type *
- p=&(*it);</code>
- fails or stores a transitory direction in p. Is this important in the
- real life? I do not know. How frequently you store the direction of the
- elements of a map? Perhaps it is not very frequent, since the logical
- thing is to store the iterators instead of the directions of the elements.
- Let us review our options: 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- 1. We used mutant knowing that is not standard, but of course
- it is supported in the 100% of the cases. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- 2. We used const_reference_pair and we declared the iterators
- not LValue. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- 3. We found some trick that still we do not know. I have thus
- been playing with unions and things, without much luck. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- 4. We leverage the restriction that views have to support
- the first, second notation. If we made this decision, there are several
- possibilities: 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- a. The left map has standard semantics first/second while
- the right map has the inverse semantics. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- b. Instead of first and second we provide first() and second(),
- with which the problem is trivial. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- c. The map view do not support first/second but left/right
- as the father relation 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- 5. We solve the problem using more memory than sizeof(pair<A,B>).
- 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- In any case, I would say that the only really unacceptable
- option is the last one. 
- 
-
- 
-</blockquote></div>
-
- Matias
- 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Lets see. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- 1. I want the "standard compliant" label in the
- library. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- 2. This is the natural choice, but knowing that there is another
- option that always works and it is more efficient is awful. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- 3. I have also tried to play with unions, the problem is that
- the union members must be POD types. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- 4. This option implies a big lost to the library. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- 5. Totally agree. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- I want to add another option to this list. Using metaprogramming,
- the relation class checks if the compiler supports the mutant idiom.
- If it supports it then it uses it and obtains zero overhead plus LValue
- iterators, but if it do not supports it then uses const_reference_pair
- and obtains minimum overhead with ReadWrite iterators. This might be
- controversial but the advantages that mutant offers are very big and
- the truth is that I do not believe that in any actual compiler this idiom
- is not supported. This scheme would adjust perfectly to the present standard
- since we are not supposing anything. The only drawback here is that although
- the mutant approach allows to make LValue iterators we have to degrade
- they to Read Write in both cases, because we want that the same code
- can be compiled in any standard compliant compiler. 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ It is not difficult to code the relation class in this way but
+ two references are initialized with every access and the use of <code class="computeroutput">pba.first</code> will be slower than <code class="computeroutput">r.left</code>
+ in most compilers. It is very difficult to optimize this kind of references.
+ 
+ </blockquote></div>
+
+ Joaquin
+ 
+<div class="blockquote"><blockquote class="blockquote">
+ This workaround is not possible, due to technical problems with
+ the expected behavior of the iterators. If the iterators of bm.left are
+ of bidirectional type, then standard stated that it have to return an object
+ of type const value_type& when dereferenced. You will have to return
+ a const_reference_pair created in the flight, making it impossible to return
+ a reference. 
+ </blockquote></div>
+
+ Matias
+ 
+<div class="blockquote"><blockquote class="blockquote">
+ I understand... I have workaround for that also but surely the
+ standard will attack me again! We must manage to create the class relation
+ that responds as we want, the rest of the code will flow from this point.
+ This clear separation between the relation class and the rest of the library,
+ is going to help to us to separate the problems and to attack them better.
+ 
+ </blockquote></div>
+
+ Joaquin
+ 
+<div class="blockquote"><blockquote class="blockquote">
+ What workaround? It already pricks my curiosity,I have dedicated
+ a long time to the subject and I do not find any solution except that we
+ allow the relation class to occupy more memory. 
+ </blockquote></div>
+
+ Matias
+ 
+<div class="blockquote"><blockquote class="blockquote">
+ We must achieve that the relation<A,B> size equals the
+ pair<A,B> size if we want this library to be really useful. I was
+ going to write my workaround and I realized that It does not work. Look
+ at this: http://www.boost.org/libs/iterator/doc/new-iter-concepts.html
+ Basically the problem that we are dealing is solved if we based our iterators
+ on this proposal. The present standard forces that the bidirectional iterators
+ also are of the type input and output. Using the new concepts there is
+ no inconvenient in making our iterators "Readable Writable Swappable
+ Bidirectional Traversal". Therefore the const_reference_pair returns
+ to be valid. 
+ </blockquote></div>
+
+ Joaquin
+ 
+<div class="blockquote"><blockquote class="blockquote">
+ It is correct in the sense that you simply say that your iterators
+ are less powerful than those of the std::map. It is not that it is wrong,
+ simply that instead of fixing the problem, you confess it. 
+ </blockquote></div>
+
+ Matias
+ 
+<div class="blockquote"><blockquote class="blockquote">
+ OK, but in our particular case; What are the benefits of offering
+ a LValue iterator against a Read Write iterator? It does not seem to me
+ that it is less powerful in this case. 
+ </blockquote></div>
+
+ Joaquin
+ 
+<div class="blockquote"><blockquote class="blockquote">
+ The main problem with a ReadWrite is that the following thing:
+ <code class="computeroutput">value_type *
+ p=&(*it);</code>
+ fails or stores a transitory direction in p. Is this important in the real
+ life? I do not know. How frequently you store the direction of the elements
+ of a map? Perhaps it is not very frequent, since the logical thing is to
+ store the iterators instead of the directions of the elements. Let us review
+ our options: 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ 1. We used mutant knowing that is not standard, but of course
+ it is supported in the 100% of the cases. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ 2. We used const_reference_pair and we declared the iterators
+ not LValue. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ 3. We found some trick that still we do not know. I have thus
+ been playing with unions and things, without much luck. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ 4. We leverage the restriction that views have to support the
+ first, second notation. If we made this decision, there are several possibilities:
+ 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ a. The left map has standard semantics first/second while the
+ right map has the inverse semantics. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ b. Instead of first and second we provide first() and second(),
+ with which the problem is trivial. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ c. The map view do not support first/second but left/right as
+ the father relation 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ 5. We solve the problem using more memory than sizeof(pair<A,B>).
+ 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ In any case, I would say that the only really unacceptable option
+ is the last one. 
+ </blockquote></div>
+
+ Matias
+ 
+<div class="blockquote"><blockquote class="blockquote">
+ Lets see. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ 1. I want the "standard compliant" label in the library.
+ 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ 2. This is the natural choice, but knowing that there is another
+ option that always works and it is more efficient is awful. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ 3. I have also tried to play with unions, the problem is that
+ the union members must be POD types. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ 4. This option implies a big lost to the library. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ 5. Totally agree. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ I want to add another option to this list. Using metaprogramming,
+ the relation class checks if the compiler supports the mutant idiom. If
+ it supports it then it uses it and obtains zero overhead plus LValue iterators,
+ but if it do not supports it then uses const_reference_pair and obtains
+ minimum overhead with ReadWrite iterators. This might be controversial
+ but the advantages that mutant offers are very big and the truth is that
+ I do not believe that in any actual compiler this idiom is not supported.
+ This scheme would adjust perfectly to the present standard since we are
+ not supposing anything. The only drawback here is that although the mutant
+ approach allows to make LValue iterators we have to degrade they to Read
+ Write in both cases, because we want that the same code can be compiled
+ in any standard compliant compiler. 
+ </blockquote></div>

 <code class="literal">- Hopefully we find our way out of the problem -</code>
 

 Joaquin
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Changing the subject, I believe that the general concept of
- hooking data is good, but I do not like the way you implement it. It
- has to be easy to migrate to B.MI to anticipate the case in that Boost.Bimap
- becomes insufficient. It is more natural for a B.MI user that the data
- is accessed without the indirection of <code class="computeroutput">.data</code>. I do not know how this can be
- articulated in your framework. 
- 
-
- 
-</blockquote></div>
-
- Matias
- 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- I have a technical problem to implement the data_hook in this
- way. If the standard would let us use the mutant idiom directly, I can
- implement it using multiple inheritance. But as we must use const_reference_pair
- too, It becomes impossible for me to support it. We have three options
- here: 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- 1) relation { left, right, data } and pair_view { first, second,
- data } 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - This is more intuitive within the bimap framework, since
- it does not mix the data with the index, as a table in a data base does,
- but gives more importance to the index. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - It is not necessary that the user puts the mutable keyword
- in each member of the data class. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - This moves away just a little bit from B.MI because the
- model of it is similar to a table, but it continues to exist a clear
- path of migration. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- 2) relation { left,right, d1,d2... dn } and pair_view { first,
- second, data } 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - The path to B.MI is the one you have proposed. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - It is very asymmetric. It is necessary to explain that the
- views are handled different that the relation. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - The user must place the mutable keyboards in the data class.
- 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- 3) Only relation { left,right, d1,d2... dn } 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - Simple migration path to B.MI. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- - You are not able to access the hooked data from the views.
- 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- My vote goes to the first proposal. 
- 
-
- 
-</blockquote></div>
-
- Joaquin
- 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Yes, the first option is the one that less surprises hold
- to the user. I also vote for 1. 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Changing the subject, I believe that the general concept of
+ hooking data is good, but I do not like the way you implement it. It has
+ to be easy to migrate to B.MI to anticipate the case in that Boost.Bimap
+ becomes insufficient. It is more natural for a B.MI user that the data
+ is accessed without the indirection of <code class="computeroutput">.data</code>. I do not know how this can be articulated
+ in your framework. 
+ </blockquote></div>
+
+ Matias
+ 
+<div class="blockquote"><blockquote class="blockquote">
+ I have a technical problem to implement the data_hook in this
+ way. If the standard would let us use the mutant idiom directly, I can
+ implement it using multiple inheritance. But as we must use const_reference_pair
+ too, It becomes impossible for me to support it. We have three options
+ here: 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ 1) relation { left, right, data } and pair_view { first, second,
+ data } 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - This is more intuitive within the bimap framework, since it
+ does not mix the data with the index, as a table in a data base does, but
+ gives more importance to the index. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - It is not necessary that the user puts the mutable keyword
+ in each member of the data class. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - This moves away just a little bit from B.MI because the model
+ of it is similar to a table, but it continues to exist a clear path of
+ migration. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ 2) relation { left,right, d1,d2... dn } and pair_view { first,
+ second, data } 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - The path to B.MI is the one you have proposed. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - It is very asymmetric. It is necessary to explain that the
+ views are handled different that the relation. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - The user must place the mutable keyboards in the data class.
+ 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ 3) Only relation { left,right, d1,d2... dn } 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - Simple migration path to B.MI. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ - You are not able to access the hooked data from the views.
+ 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ My vote goes to the first proposal. 
+ </blockquote></div>
+
+ Joaquin
+ 
+<div class="blockquote"><blockquote class="blockquote">
+ Yes, the first option is the one that less surprises hold to
+ the user. I also vote for 1. 
+ </blockquote></div>

 <code class="literal">- The third week was over -</code>
 

 Matias
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- There is still one problem that I have to solve. I need to
- know if it is necessary to create a map_view associated to nothing. If
- it is necessary there are two options: that it behaves as an empty container
- or that it throws an exception or assert when trying to use it. If it
- is not necessary, the map_view is going to keep a reference instead of
- a pointer. To me, the map_view always must be viewing something. In the
- case of the iterators being able to create them empty, makes them easy
- to use in contexts that require constructors by default, like being the
- value_type of a container, but I do not believe that this is the case
- of map_view. 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ There is still one problem that I have to solve. I need to know
+ if it is necessary to create a map_view associated to nothing. If it is
+ necessary there are two options: that it behaves as an empty container
+ or that it throws an exception or assert when trying to use it. If it is
+ not necessary, the map_view is going to keep a reference instead of a pointer.
+ To me, the map_view always must be viewing something. In the case of the
+ iterators being able to create them empty, makes them easy to use in contexts
+ that require constructors by default, like being the value_type of a container,
+ but I do not believe that this is the case of map_view. 
+ </blockquote></div>

 Joaquin
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- How would an empty map_view be useful? My intuition is like
- yours, map_view would have to be always associate to something. If we
- wished to obtain the semantics "is associated or not" we can
- use a pointer to a map_view. 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ How would an empty map_view be useful? My intuition is like
+ yours, map_view would have to be always associate to something. If we wished
+ to obtain the semantics "is associated or not" we can use a pointer
+ to a map_view. 
+ </blockquote></div>

 Matias
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- OK, then you agree to that map_views stores a reference instead
- of a pointer? 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ OK, then you agree to that map_views stores a reference instead
+ of a pointer? 
+ </blockquote></div>

 Joaquin
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- It depends on the semantics you want to give to map_views,
- and in concrete to the copy of map_views. 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ It depends on the semantics you want to give to map_views, and
+ in concrete to the copy of map_views. 
+ </blockquote></div>



@@ -1297,84 +714,42 @@
</pre>

 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- What is supposed to do this last line? 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- 1. Rebinding of x, that is to say, x points at the same container
- that y. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- 2. Copy of the underlying container. 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- If you want to implement 1, you cannot use references internally.
- If you want to implement 2, it is almost the same to use a reference
- or a pointer. 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ What is supposed to do this last line? 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ 1. Rebinding of x, that is to say, x points at the same container
+ that y. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ 2. Copy of the underlying container. 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ If you want to implement 1, you cannot use references internally.
+ If you want to implement 2, it is almost the same to use a reference or
+ a pointer. 
+ </blockquote></div>

 Matias
 
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- If I want that they behave exactly as std::maps then I must
- go for 2. But if I think they as "views" of something, I like
- 1. The question is complicated. I add another option: 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- 3. Error: operator= is declare as private in boost::bimap::map_view
- std_container 
- 
-
- 
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Also What happens with <code class="computeroutput">std_container
- = view;</code>? and with <code class="computeroutput">view
- = std_container;</code>? 
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ If I want that they behave exactly as std::maps then I must
+ go for 2. But if I think they as "views" of something, I like
+ 1. The question is complicated. I add another option: 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ 3. Error: operator= is declare as private in boost::bimap::map_view
+ std_container 
+ </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Also What happens with <code class="computeroutput">std_container
+ = view;</code>? and with <code class="computeroutput">view
+ = std_container;</code>? 
+ </blockquote></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -1382,7 +757,7 @@
</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>
+<a accesskey="p" href="code.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../history.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Reference</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<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="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">
</head>
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="bimap_and_boost/dependencies.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reference/bimap_reference.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Reference">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="boost_bimap.reference"></a><a class="link" href="reference.html" title="Reference">Reference</a>
</h2></div></div></div>
@@ -89,7 +89,7 @@
 Views</a></dt>
</dl></dd>
</dl></div>
-<div class="section" title="Headers">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<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>
@@ -100,55 +100,55 @@
 Convenience
 
<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>
+ "boost/bimap.hpp" (includes "boost/bimap/bimap.hpp"
+ and imports the bimap class to boost namespace)
+ </li></ul></div>

 Container
 
<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>
+ "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 class="itemizedlist" type="disc">
<li class="listitem">
- "boost/bimap/set_of.hpp"
- </li>
+ "boost/bimap/set_of.hpp"
+ </li>
<li class="listitem">
- "boost/bimap/multiset_of.hpp"
- </li>
+ "boost/bimap/multiset_of.hpp"
+ </li>
<li class="listitem">
- "boost/bimap/unordered_set_of.hpp"
- </li>
+ "boost/bimap/unordered_set_of.hpp"
+ </li>
<li class="listitem">
- "boost/bimap/unordered_multiset_of.hpp"
- </li>
+ "boost/bimap/unordered_multiset_of.hpp"
+ </li>
<li class="listitem">
- "boost/bimap/list_of.hpp"
- </li>
+ "boost/bimap/list_of.hpp"
+ </li>
<li class="listitem">
- "boost/bimap/vector_of.hpp"
- </li>
+ "boost/bimap/vector_of.hpp"
+ </li>
<li class="listitem">
- "boost/bimap/unconstrained_set_of.hpp"
- </li>
+ "boost/bimap/unconstrained_set_of.hpp"
+ </li>
</ul></div>

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

 A program using Boost.Bimap must therefore include "boost/bimap/bimap.hpp"
@@ -167,7 +167,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -175,7 +175,7 @@
</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>
+<a accesskey="p" href="bimap_and_boost/dependencies.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reference/bimap_reference.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Bimap Reference</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<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">
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="../reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="set_of_reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Bimap Reference">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<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>
@@ -53,7 +53,7 @@
<dt>Serialization</dt>
</dl></dd>
</dl></div>
-<div class="section" title="View concepts">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<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>
@@ -81,26 +81,26 @@
 
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- copying
- </li>
+ copying
+ </li>
+<li class="listitem">
+ insertion of an element
+ </li>
+<li class="listitem">
+ hinted insertion, where a pre-existing element is suggested in order
+ to improve the efficiency of the operation
+ </li>
+<li class="listitem">
+ deletion of an element
+ </li>
<li class="listitem">
- insertion of an element
- </li>
+ 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 class="listitem">
- hinted insertion, where a pre-existing element is suggested in order
- to improve the efficiency of the operation
- </li>
-<li class="listitem">
- deletion of an element
- </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 class="listitem">
- modification of an element, and its subsequent rearrangement/banning
- by the various views
- </li>
+ modification of an element, and its subsequent rearrangement/banning
+ by the various views
+ </li>
</ul></div>

 The last two primitives deserve some further explanation: in order to guarantee
@@ -111,9 +111,7 @@
 fashion.
 
</div>
-<a name="complexity_signature_explanation"></a>
- 
-<div class="section" title="Complexity signature">
+<a name="complexity_signature_explanation"></a><div class="section">
<div class="titlepage"><div><div><h4 class="title">
<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>
@@ -131,29 +129,29 @@
 
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<code class="computeroutput">c(n)</code>:
- copying
- </li>
-<li class="listitem">
-<code class="computeroutput">i(n)</code>:
- insertion
- </li>
-<li class="listitem">
-<code class="computeroutput">h(n)</code>:
- hinted insertion
- </li>
-<li class="listitem">
-<code class="computeroutput">d(n)</code>:
- deletion
- </li>
-<li class="listitem">
-<code class="computeroutput">r(n)</code>:
- replacement
- </li>
-<li class="listitem">
-<code class="computeroutput">m(n)</code>:
- modifying
- </li>
+ <code class="computeroutput">c(n)</code>:
+ copying
+ </li>
+<li class="listitem">
+ <code class="computeroutput">i(n)</code>:
+ insertion
+ </li>
+<li class="listitem">
+ <code class="computeroutput">h(n)</code>:
+ hinted insertion
+ </li>
+<li class="listitem">
+ <code class="computeroutput">d(n)</code>:
+ deletion
+ </li>
+<li class="listitem">
+ <code class="computeroutput">r(n)</code>:
+ replacement
+ </li>
+<li class="listitem">
+ <code class="computeroutput">m(n)</code>:
+ modifying
+ </li>
</ul></div>

 If the collection type of the relation is <code class="computeroutput">left_based</code>
@@ -169,21 +167,27 @@
 To abbreviate the notation, we adopt the following definitions:
 
<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 class="listitem"><code class="computeroutput">I(n) = i_l(n) + i_r(n) [ +
- i_a(n) ]</code></li>
-<li class="listitem"><code class="computeroutput">H(n) = h_l(n) + h_r(n) [ +
- h_a(n) ]</code></li>
-<li class="listitem"><code class="computeroutput">D(n) = d_l(n) + d_r(n) [ +
- d_a(n) ]</code></li>
-<li class="listitem"><code class="computeroutput">R(n) = r_l(n) + r_r(n) [ +
- r_a(n) ]</code></li>
-<li class="listitem"><code class="computeroutput">M(n) = m_l(n) + m_r(n) [ +
- m_a(n) ]</code></li>
+<li class="listitem">
+ <code class="computeroutput">C(n) = c_l(n) + c_r(n) [ + c_a(n) ]</code>
+ </li>
+<li class="listitem">
+ <code class="computeroutput">I(n) = i_l(n) + i_r(n) [ + i_a(n) ]</code>
+ </li>
+<li class="listitem">
+ <code class="computeroutput">H(n) = h_l(n) + h_r(n) [ + h_a(n) ]</code>
+ </li>
+<li class="listitem">
+ <code class="computeroutput">D(n) = d_l(n) + d_r(n) [ + d_a(n) ]</code>
+ </li>
+<li class="listitem">
+ <code class="computeroutput">R(n) = r_l(n) + r_r(n) [ + r_a(n) ]</code>
+ </li>
+<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" title="Set type specification">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<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>
@@ -207,177 +211,173 @@
</colgroup>
<thead><tr>
<th>
- 
- Side collection type
- 
+ 
+ Side collection type
+ 
 </th>
<th>
- 
- Collection type of relation
- 
+ 
+ Collection type of relation
+ 
 </th>
<th>
- 
- Include
- 
+ 
+ Include
+ 
 </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- <code class="computeroutput">set_of</code>
- 
+ 
+ <code class="computeroutput">set_of</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">set_of_relation</code>
- 
+ 
+ <code class="computeroutput">set_of_relation</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">boost/bimap/set_of.hpp</code>
- 
+ 
+ <code class="computeroutput">boost/bimap/set_of.hpp</code>
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">multiset_of</code>
- 
+ 
+ <code class="computeroutput">multiset_of</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">multiset_of_relation</code>
- 
+ 
+ <code class="computeroutput">multiset_of_relation</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">boost/bimap/multiset_of.hpp</code>
- 
+ 
+ <code class="computeroutput">boost/bimap/multiset_of.hpp</code>
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">unordered_set_of</code>
- 
+ 
+ <code class="computeroutput">unordered_set_of</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">unordered_set_of_relation</code>
- 
+ 
+ <code class="computeroutput">unordered_set_of_relation</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">boost/bimap/unordered_set_of.hpp</code>
- 
+ 
+ <code class="computeroutput">boost/bimap/unordered_set_of.hpp</code>
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">unordered_multiset_of</code>
- 
+ 
+ <code class="computeroutput">unordered_multiset_of</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">unordered_multiset_of_relation</code>
- 
+ 
+ <code class="computeroutput">unordered_multiset_of_relation</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">boost/bimap/unordered_multiset_of.hpp</code>
- 
+ 
+ <code class="computeroutput">boost/bimap/unordered_multiset_of.hpp</code>
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">list_of</code>
- 
+ 
+ <code class="computeroutput">list_of</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">list_of_relation</code>
- 
+ 
+ <code class="computeroutput">list_of_relation</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">boost/bimap/list_of.hpp</code>
- 
+ 
+ <code class="computeroutput">boost/bimap/list_of.hpp</code>
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">vector_of</code>
- 
+ 
+ <code class="computeroutput">vector_of</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">vector_of_relation</code>
- 
+ 
+ <code class="computeroutput">vector_of_relation</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">boost/bimap/vector_of.hpp</code>
- 
+ 
+ <code class="computeroutput">boost/bimap/vector_of.hpp</code>
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">unconstrained_set_of</code>
- 
+ 
+ <code class="computeroutput">unconstrained_set_of</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">unconstrained_set_of_relation</code>
- 
+ 
+ <code class="computeroutput">unconstrained_set_of_relation</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">boost/bimap/unconstrained_set_of.hpp</code>
- 
+ 
+ <code class="computeroutput">boost/bimap/unconstrained_set_of.hpp</code>
+ 
 </td>
</tr>
<tr>
<td>
- 
- 
 </td>
<td>
- 
- <code class="computeroutput">left_based</code>
- 
+ 
+ <code class="computeroutput">left_based</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">boost/bimap/bimap.hpp</code>
- 
+ 
+ <code class="computeroutput">boost/bimap/bimap.hpp</code>
+ 
 </td>
</tr>
<tr>
<td>
- 
- 
 </td>
<td>
- 
- <code class="computeroutput">right_based</code>
- 
+ 
+ <code class="computeroutput">right_based</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">boost/bimap/bimap.hpp</code>
- 
+ 
+ <code class="computeroutput">boost/bimap/bimap.hpp</code>
+ 
 </td>
</tr>
</tbody>
</table></div>
</div>
-<div class="section" title="Tags">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<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>
@@ -387,7 +387,7 @@
 uses the tagged idiom to let the user specify this tags.
 
</div>
-<div class="section" title='Header "boost/bimap/bimap.hpp" synopsis'>
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<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>
@@ -484,7 +484,7 @@
} // namespace boost
</pre>
</div>
-<div class="section" title="Class template bimap">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<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>
@@ -506,7 +506,7 @@

 This is the main component of Boost.Bimap.
 
-<div class="section" title="Complexity">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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>
@@ -515,7 +515,7 @@
 we adopt the scheme outlined in the complexity signature section.
 
</div>
-<div class="section" title="Instantiation types">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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>
@@ -526,106 +526,68 @@
 
<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>
+ 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 class="listitem">
- AdditionalParameter_{1/2} can be any ordered subset of:
- <div class="itemizedlist"><ul class="itemizedlist" type="disc">
+ AdditionalParameter_{1/2} can be any ordered subset of:
+ <div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- CollectionTypeOfRelation specification
- </li>
+ CollectionTypeOfRelation specification
+ </li>
<li class="listitem">
- Allocator
- </li>
+ Allocator
+ </li>
</ul></div>
-</li>
+ </li>
</ol></div>
</div>
-<div class="section" title="Nested types">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Tags for each side of the bimap. If the user has not specified any
- tag the tags default to <code class="computeroutput">member_at::left</code>
- and <code class="computeroutput">member_at::right</code>.
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Tags for each side of the bimap. If the user has not specified any
+ tag the tags default to <code class="computeroutput">member_at::left</code>
+ and <code class="computeroutput">member_at::right</code>.
+ </blockquote></div>
<pre class="programlisting">left_key_type, right_key_type
</pre>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Key type of each side. In a <code class="computeroutput">bimap<A,B> </code> <code class="computeroutput">left_key_type</code>
- is <code class="computeroutput">A</code> and <code class="computeroutput">right_key_type</code> is <code class="computeroutput">B</code>. If there are tags, it is better
- to use: <code class="computeroutput">Bimap::map_by<Tag>::key_type</code>.
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Key type of each side. In a <code class="computeroutput">bimap<A,B> </code> <code class="computeroutput">left_key_type</code>
+ is <code class="computeroutput">A</code> and <code class="computeroutput">right_key_type</code> is <code class="computeroutput">B</code>.
+ If there are tags, it is better to use: <code class="computeroutput">Bimap::map_by<Tag>::key_type</code>.
+ </blockquote></div>
<pre class="programlisting">left_data_type, right_data_type
</pre>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Data type of each side. In a bimap<A,B> left_key_type is B
- and right_key_type is A. If there are tags, it is better to use:
- <code class="computeroutput">Bimap::map_by<Tag>::data_type</code>.
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Data type of each side. In a bimap<A,B> left_key_type is B and
+ right_key_type is A. If there are tags, it is better to use: <code class="computeroutput">Bimap::map_by<Tag>::data_type</code>.
+ </blockquote></div>
<pre class="programlisting">left_value_type, right_value_type
</pre>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Value type used for the views. If there are tags, it is better to
- use: <code class="computeroutput">Bimap::map_by<Tag>::value_type</code>.
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Value type used for the views. If there are tags, it is better to use:
+ <code class="computeroutput">Bimap::map_by<Tag>::value_type</code>.
+ </blockquote></div>
<pre class="programlisting">left_iterator, right_iterator
left_const_iterator, right_const_iterator
</pre>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Iterators of the views. If there are tags, it is better to use:
- <code class="computeroutput">Bimap::map_by<Tag>::iterator</code> and <code class="computeroutput">Bimap::map_by<Tag>::const_iterator</code>
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Iterators of the views. If there are tags, it is better to use: <code class="computeroutput">Bimap::map_by<Tag>::iterator</code> and <code class="computeroutput">Bimap::map_by<Tag>::const_iterator</code>
+ </blockquote></div>
<pre class="programlisting">left_map, right_map
</pre>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- Map view type of each side. If there are tags, it is better to use:
- <code class="computeroutput">Bimap::map_by<Tag>::type</code>.
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ Map view type of each side. If there are tags, it is better to use:
+ <code class="computeroutput">Bimap::map_by<Tag>::type</code>.
+ </blockquote></div>
</div>
-<div class="section" title="Constructors, copy and assignment">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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>
@@ -634,92 +596,90 @@
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-Effects: Constructs an empty <code class="computeroutput">bimap</code>.
- </li>
+ Effects: Constructs an empty <code class="computeroutput">bimap</code>.
+ </li>
<li class="listitem">
-Complexity: Constant.
- </li>
+ Complexity: Constant.
+ </li>
</ul></div>
<pre class="programlisting">template<typename InputIterator>
bimap(InputIterator first,InputIterator last);
</pre>
<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 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 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>
+ 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 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 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>
<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 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 class="listitem">
-Complexity: O(x.size()*log(x.size())
- + C(x.size()))
- </li>
+ Effects: Constructs a copy of x,
+ copying its elements as well as its internal objects (key extractors,
+ comparison objects, allocator.)
+ </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 class="listitem">
+ Complexity: O(x.size()*log(x.size())
+ + C(x.size()))
+ </li>
</ul></div>
<pre class="programlisting">~bimap()
</pre>
<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>
+ 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 class="listitem">
-Complexity: O(n).
- </li>
+ Complexity: O(n).
+ </li>
</ul></div>
<pre class="programlisting">bimap& operator=(const bimap& x);
</pre>
<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>
+ Effects: Replaces the elements and
+ internal objects of the <code class="computeroutput">bimap</code>
+ with copies from x.
+ </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>
+ 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 class="listitem">
-Returns: <code class="computeroutput">*this</code>.
- </li>
+ Returns: <code class="computeroutput">*this</code>.
+ </li>
<li class="listitem">
-Complexity: O(n + x.size()*log(x.size())
- + C(x.size())).
- </li>
+ Complexity: O(n + x.size()*log(x.size())
+ + C(x.size())).
+ </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.
- </li>
+ Exception safety: Strong, provided
+ the copy and assignment operations of the types of <code class="computeroutput">ctor_args_list</code> do not throw.
+ </li>
</ul></div>
</div>
-<a name="reference_projection_operations"></a>
- 
-<div class="section" title="Projection operations">
+<a name="reference_projection_operations"></a><div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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>
@@ -731,14 +691,14 @@
 
<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>
+ <code class="computeroutput">it1 ==
+ i1.end()</code>
+ AND <code class="computeroutput">it2 ==
+ i2.end()</code>,
+ </li>
<li class="listitem">
- OR <code class="computeroutput">it1</code> and <code class="computeroutput">it2</code> point to the same element.
- </li>
+ 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 >
left_iterator project_left(IteratorType iter);
@@ -748,20 +708,21 @@
</pre>
<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>
+ 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 class="listitem">
+ Effects: Returns a left map view
+ iterator equivalent to <code class="computeroutput">it</code>.
+ </li>
<li class="listitem">
-Effects: Returns a left map view iterator
- equivalent to <code class="computeroutput">it</code>.
- </li>
-<li class="listitem">
-Complexity: Constant.
- </li>
+ Complexity: Constant.
+ </li>
<li class="listitem">
-Exception safety: nothrow.
- </li>
+ Exception safety: nothrow.
+ </li>
</ul></div>
<pre class="programlisting">template< class IteratorType >
right_iterator project_right(IteratorType iter);
@@ -771,20 +732,21 @@
</pre>
<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 class="listitem">
-Effects: Returns a right map view
- iterator equivalent to <code class="computeroutput">it</code>.
- </li>
+ 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 class="listitem">
+ Effects: Returns a right map view
+ iterator equivalent to <code class="computeroutput">it</code>.
+ </li>
<li class="listitem">
-Complexity: Constant.
- </li>
+ Complexity: Constant.
+ </li>
<li class="listitem">
-Exception safety: nothrow.
- </li>
+ Exception safety: nothrow.
+ </li>
</ul></div>
<pre class="programlisting">template< class IteratorType >
iterator project_up(IteratorType iter);
@@ -794,25 +756,24 @@
</pre>
<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>
+ 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 class="listitem">
-Effects: Returns a collection of relations
- view iterator equivalent to <code class="computeroutput">it</code>.
- </li>
+ Effects: Returns a collection of
+ relations view iterator equivalent to <code class="computeroutput">it</code>.
+ </li>
<li class="listitem">
-Complexity: Constant.
- </li>
+ Complexity: Constant.
+ </li>
<li class="listitem">
-Exception safety: nothrow.
- </li>
+ Exception safety: nothrow.
+ </li>
</ul></div>
</div>
-<a name="reference_support_for_used_defined_names"></a>
- 
-<div class="section" title="Support for user defined names">
+<a name="reference_support_for_used_defined_names"></a><div class="section">
<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 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>
@@ -822,14 +783,15 @@
</pre>
<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 class="listitem">
-Requires: <code class="computeroutput">Tag</code>
- is a valid user defined name of the bimap.
- </li>
+ <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 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 >
map_by<Tag>::type by();
@@ -839,20 +801,20 @@
</pre>
<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>
+ Requires: <code class="computeroutput">Tag</code>
+ is a valid user defined name of the bimap.
+ </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 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>
+ Complexity: Constant.
+ </li>
<li class="listitem">
-Complexity: Constant.
- </li>
-<li class="listitem">
-Exception safety: nothrow.
- </li>
+ Exception safety: nothrow.
+ </li>
</ul></div>
<pre class="programlisting">template< class Tag, class IteratorType >
map_by<Tag>::iterator project(IteratorType iter);
@@ -862,25 +824,26 @@
</pre>
<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>
+ 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 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 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>
+ Complexity: Constant.
+ </li>
<li class="listitem">
-Complexity: Constant.
- </li>
-<li class="listitem">
-Exception safety: nothrow.
- </li>
+ Exception safety: nothrow.
+ </li>
</ul></div>
</div>
-<div class="section" title="Serialization">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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>
@@ -908,8 +871,8 @@
 if
 
<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>
+ <code class="computeroutput">p(x,y) == q(x</code>'<code class="computeroutput">,y</code>'<code class="computeroutput">)</code>
+ </li></ul></div>

 for every <code class="computeroutput">x</code> and <code class="computeroutput">y</code> of type <code class="computeroutput">T</code>
 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>,
@@ -924,14 +887,15 @@
</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 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>
+ Requires: Value is serializable
+ (XML-serializable). Additionally, each of the views of b can impose
+ other requirements.
+ </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">

@@ -942,21 +906,20 @@
</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 class="listitem">
-Exception safety: Basic. If an exception
- is thrown, ar may be left in an inconsistent state.
- </li>
+ Requires: Value is serializable
+ (XML-serializable). Additionally, each of the views of <code class="computeroutput">b</code>' can impose other requirements.
+ </li>
+<li class="listitem">
+ Exception safety: Basic. If an exception
+ is thrown, ar may be left in an inconsistent state.
+ </li>
</ul></div>
</div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -964,7 +927,7 @@
</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>
+<a accesskey="p" href="../reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="set_of_reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>list_of Reference</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<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">
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="unordered_set_of_reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="vector_of_reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="list_of Reference">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<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>
@@ -48,7 +48,7 @@
<dt>Serialization</dt>
</dl></dd>
</dl></div>
-<div class="section" title='Header "boost/bimap/list_of.hpp" synopsis'>
+<div class="section">
<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 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>
@@ -67,7 +67,7 @@
} // namespace boost
</pre>
</div>
-<div class="section" title="list_of Views">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<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>
@@ -110,19 +110,19 @@
 
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- list_of views are not Assignable
- (like any other view.)
- </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 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.
- </li>
+ list_of views are not Assignable
+ (like any other view.)
+ </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 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.
+ </li>
</ul></div>

 Having these restrictions into account, list_of views are models of Reversible Container,
@@ -312,9 +312,7 @@

typedef signature-compatible with std::pair< ... , Left > value_type;
</pre>
-<a name="list_of_complexity_signature"></a>
- 
-<div class="section" title="Complexity signature">
+<a name="list_of_complexity_signature"></a><div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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>
@@ -326,26 +324,30 @@
 
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- copying: <code class="computeroutput">c(n) = n * log(n)</code>,
- </li>
-<li class="listitem">
- insertion: <code class="computeroutput">i(n) = 1</code> (constant),
- </li>
-<li class="listitem">
- hinted insertion: <code class="computeroutput">h(n) = 1</code> (constant),
- </li>
+ copying: <code class="computeroutput">c(n) = n * log(n)</code>,
+ </li>
<li class="listitem">
- deletion: <code class="computeroutput">d(n) = 1</code> (constant),
- </li>
-<li class="listitem">
- replacement: <code class="computeroutput">r(n) = 1</code> (constant),
- </li>
-<li class="listitem">
- modifying: <code class="computeroutput">m(n) = 1</code> (constant).
- </li>
+ insertion: <code class="computeroutput">i(n) = 1</code>
+ (constant),
+ </li>
+<li class="listitem">
+ hinted insertion: <code class="computeroutput">h(n) = 1</code> (constant),
+ </li>
+<li class="listitem">
+ deletion: <code class="computeroutput">d(n) = 1</code>
+ (constant),
+ </li>
+<li class="listitem">
+ replacement: <code class="computeroutput">r(n) = 1</code>
+ (constant),
+ </li>
+<li class="listitem">
+ modifying: <code class="computeroutput">m(n) = 1</code>
+ (constant).
+ </li>
</ul></div>
</div>
-<div class="section" title="Instantiation types">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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>
@@ -358,14 +360,14 @@
 
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<code class="computeroutput">Value</code> from <code class="computeroutput">list_of</code>,
- </li>
+ <code class="computeroutput">Value</code> from <code class="computeroutput">list_of</code>,
+ </li>
<li class="listitem">
-<code class="computeroutput">Allocator</code> from <code class="computeroutput">bimap</code>,
- </li>
+ <code class="computeroutput">Allocator</code> from <code class="computeroutput">bimap</code>,
+ </li>
</ul></div>
</div>
-<div class="section" title="Constructors, copy and assignment">
+<div class="section">
<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 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>
@@ -378,451 +380,422 @@
</pre>
<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>
+ 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 class="listitem">
-Returns: <code class="computeroutput">*this</code>.
- </li>
+ Returns: <code class="computeroutput">*this</code>.
+ </li>
</ul></div>
-<a name="reference_list_of_assign_iterator_iterator"></a>
- 
-<pre class="programlisting">template< class InputIterator >
+<a name="reference_list_of_assign_iterator_iterator"></a><pre class="programlisting">template< class InputIterator >
void assign(InputIterator first, InputIterator last);
</pre>
<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>
- or a type convertible to <code class="computeroutput">value_type</code>.
- first and last are not iterators into any views of the <code class="computeroutput">bimap</code> to which this view belongs.
- <code class="computeroutput">last</code> is reachable from
- <code class="computeroutput">first</code>.
- </li>
+ 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>
+ or a type convertible to <code class="computeroutput">value_type</code>.
+ first and last are not iterators into any views of the <code class="computeroutput">bimap</code> to which this view belongs.
+ <code class="computeroutput">last</code> is reachable
+ from <code class="computeroutput">first</code>.
+ </li>
<li class="listitem">
-Effects: <code class="computeroutput">clear(); insert(end(),first,last);</code>
-</li>
+ 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);
+<a name="reference_list_of_assign_size_value"></a><pre class="programlisting">void assign(size_type n, const value_type & value);
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
-Effects: <code class="computeroutput">clear(); for(size_type
- i =
- 0;
- i <
- n ;
- ++n) push_back(v);</code>
-</li></ul></div>
+ Effects: <code class="computeroutput">clear(); for(size_type
+ i =
+ 0;
+ i <
+ n ;
+ ++n) push_back(v);</code>
+ </li></ul></div>
</div>
-<div class="section" title="Capacity operations">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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());
+<a name="reference_list_of_resize_size_value"></a><pre class="programlisting">void resize(size_type n,const value_type& x=value_type());
</pre>
<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() ) {</code><code class="computeroutput"> iterator
- it =
- begin();</code><code class="computeroutput"> std::advance(it, n);</code><code class="computeroutput"> erase(it, end());</code><code class="computeroutput">}</code>
-</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>
+ Effects: <code class="computeroutput">if( n > size() ) insert(end(),
+ n -
+ size(),
+ x);</code>
+ <code class="computeroutput">else if( n < size() ) {</code> <code class="computeroutput"> iterator
+ it =
+ begin();</code>
+ <code class="computeroutput"> std::advance(it, n);</code>
+ <code class="computeroutput"> erase(it, end());</code>
+ <code class="computeroutput">}</code>
+ </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" title="Modifiers">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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);
+<a name="reference_list_of_push_front_value"></a><pre class="programlisting">std::pair<iterator,bool> push_front(const value_type& x);
</pre>
<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>
+ 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 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
- insertion took place. On successful insertion, <code class="computeroutput">p.first</code>
- points to the element inserted; otherwise, <code class="computeroutput">p.first</code>
- points to an element that caused the insertion to be banned. Note that
- more than one element can be causing insertion not to be allowed.
- </li>
+ 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 insertion took place. On successful insertion, <code class="computeroutput">p.first</code> points to the element inserted;
+ otherwise, <code class="computeroutput">p.first</code> points to an element that
+ caused the insertion to be banned. Note that more than one element
+ can be causing insertion not to be allowed.
+ </li>
<li class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
- O(I(n)).
- </li>
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
+ O(I(n)).
+ </li>
<li class="listitem">
-Exception safety: Strong.
- </li>
+ 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);
+<a name="reference_list_of_push_back_value"></a><pre class="programlisting">std::pair<iterator,bool> push_back(const value_type & x);
</pre>
<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>
+ 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 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
- insertion took place. On successful insertion, <code class="computeroutput">p.first</code>
- points to the element inserted; otherwise, <code class="computeroutput">p.first</code>
- points to an element that caused the insertion to be banned. Note that
- more than one element can be causing insertion not to be allowed.
- </li>
+ 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 insertion took place. On successful insertion, <code class="computeroutput">p.first</code> points to the element inserted;
+ otherwise, <code class="computeroutput">p.first</code> points to an element that
+ caused the insertion to be banned. Note that more than one element
+ can be causing insertion not to be allowed.
+ </li>
<li class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
- O(I(n)).
- </li>
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
+ O(I(n)).
+ </li>
<li class="listitem">
-Exception safety: Strong.
- </li>
+ 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);
+<a name="reference_list_of_insert_iterator_value"></a><pre class="programlisting">std::pair<iterator,bool> insert(iterator position, const value_type & x);
</pre>
<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>
+ Requires: <code class="computeroutput">position</code>
+ is a valid <code class="computeroutput">iterator</code>
+ of the view.
+ </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>
+ 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 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
- insertion took place. On successful insertion, <code class="computeroutput">p.first</code>
- points to the element inserted; otherwise, <code class="computeroutput">p.first</code>
- points to an element that caused the insertion to be banned. Note that
- more than one element can be causing insertion not to be allowed.
- </li>
+ 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 insertion took place. On successful insertion, <code class="computeroutput">p.first</code> points to the element inserted;
+ otherwise, <code class="computeroutput">p.first</code> points to an element that
+ caused the insertion to be banned. Note that more than one element
+ can be causing insertion not to be allowed.
+ </li>
<li class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
- O(I(n)).
- </li>
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
+ O(I(n)).
+ </li>
<li class="listitem">
-Exception safety: Strong.
- </li>
+ 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);
+<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>
<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>
+ Requires: <code class="computeroutput">position</code>
+ is a valid <code class="computeroutput">iterator</code>
+ of the view.
+ </li>
<li class="listitem">
-Effects: <code class="computeroutput">for(size_type
- i =
- 0;
- i <
- n;
- ++i) insert(position, x);</code>
-</li>
+ Effects: <code class="computeroutput">for(size_type
+ i =
+ 0;
+ i <
+ n;
+ ++i) insert(position, x);</code>
+ </li>
</ul></div>
-<a name="reference_list_of_insert_iterator_iterator_iterator"></a>
- 
-<pre class="programlisting">template< class InputIterator>
+<a name="reference_list_of_insert_iterator_iterator_iterator"></a><pre class="programlisting">template< class InputIterator>
void insert(iterator position,InputIterator first,InputIterator last);
</pre>
<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>
- 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>.
- <code class="computeroutput">first</code> and <code class="computeroutput">last</code> are not iterators into any view
- of the <code class="computeroutput">bimap</code> to which
- this view belongs. <code class="computeroutput">last</code>
- is reachable from <code class="computeroutput">first</code>.
- </li>
+ Requires: <code class="computeroutput">position</code>
+ is a valid <code class="computeroutput">iterator</code>
+ 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
+ Iterator</a> over elements of type <code class="computeroutput">value_type</code>.
+ <code class="computeroutput">first</code> and <code class="computeroutput">last</code> are not iterators into any
+ view of the <code class="computeroutput">bimap</code>
+ to which this view belongs. <code class="computeroutput">last</code>
+ is reachable from <code class="computeroutput">first</code>.
+ </li>
<li class="listitem">
-Effects: <code class="computeroutput">while(first
- != last) insert(position, *first++);</code>
-</li>
+ Effects: <code class="computeroutput">while(first
+ != last) insert(position, *first++);</code>
+ </li>
<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>
+ <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 class="listitem">
-Exception safety: Basic.
- </li>
+ Exception safety: Basic.
+ </li>
</ul></div>
-<a name="reference_list_of_erase_iterator"></a>
- 
-<pre class="programlisting">iterator erase(iterator position);
+<a name="reference_list_of_erase_iterator"></a><pre class="programlisting">iterator erase(iterator position);
</pre>
<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>
+ Requires: <code class="computeroutput">position</code>
+ is a valid dereferenceable <code class="computeroutput">iterator</code>
+ of the view.
+ </li>
<li class="listitem">
-Effects: Deletes the element pointed
- to by <code class="computeroutput">position</code>.
- </li>
+ Effects: Deletes the element pointed
+ to by <code class="computeroutput">position</code>.
+ </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>
+ 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 class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
- O(D(n)).
- </li>
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
+ O(D(n)).
+ </li>
<li class="listitem">
-Exception safety: nothrow.
- </li>
+ Exception safety: nothrow.
+ </li>
</ul></div>
-<a name="reference_list_of_erase_iterator_iterator"></a>
- 
-<pre class="programlisting">iterator erase(iterator first, iterator last);
+<a name="reference_list_of_erase_iterator_iterator"></a><pre class="programlisting">iterator erase(iterator first, iterator last);
</pre>
<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>
+ Requires: <code class="computeroutput">[first,last)</code>
+ is a valid range of the view.
+ </li>
<li class="listitem">
-Effects: Deletes the elements in
- <code class="computeroutput">[first,last)</code>.
- </li>
+ Effects: Deletes the elements in
+ <code class="computeroutput">[first,last)</code>.
+ </li>
<li class="listitem">
-Returns: <code class="computeroutput">last</code>.
- </li>
+ Returns: <code class="computeroutput">last</code>.
+ </li>
<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>
+ <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 class="listitem">
-Exception safety: nothrow.
- </li>
+ 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);
+<a name="reference_list_of_replace_iterator_value"></a><pre class="programlisting">bool replace(iterator position,const value_type& x);
</pre>
<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>
+ Requires: <code class="computeroutput">position</code>
+ is a valid dereferenceable iterator of the view.
+ </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>
+ 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 class="listitem">
-Postconditions: Validity of <code class="computeroutput">position</code> is preserved in all cases.
- </li>
+ Postconditions: Validity of <code class="computeroutput">position</code> is preserved in all cases.
+ </li>
<li class="listitem">
-Returns: <code class="computeroutput">true</code>
- if the replacement took place, <code class="computeroutput">false</code>
- otherwise.
- </li>
+ Returns: <code class="computeroutput">true</code>
+ if the replacement took place, <code class="computeroutput">false</code>
+ otherwise.
+ </li>
<li class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
- O(R(n)).
- </li>
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
+ O(R(n)).
+ </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.
- </li>
+ 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.
+ </li>
</ul></div>
-<a name="reference_list_of_replace_key_iterator_key"></a>
- 
-<pre class="programlisting">template< class CompatibleKey >
+<a name="reference_list_of_replace_key_iterator_key"></a><pre class="programlisting">template< class CompatibleKey >
bool replace_key(iterator position, const CompatibleKey & x);
</pre>
<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 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 replacing is allowed by all other views of
- the <code class="computeroutput">bimap</code>.
- </li>
-<li class="listitem">
-Postconditions: Validity of position
- is preserved in all cases.
- </li>
-<li class="listitem">
-Returns: <code class="computeroutput">true</code>
- if the replacement took place, <code class="computeroutput">false</code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
- O(R(n)).
- </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.
- </li>
+ 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 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 replacing is allowed by all other views
+ of the <code class="computeroutput">bimap</code>.
+ </li>
+<li class="listitem">
+ Postconditions: Validity of position
+ is preserved in all cases.
+ </li>
+<li class="listitem">
+ Returns: <code class="computeroutput">true</code>
+ if the replacement took place, <code class="computeroutput">false</code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
+ O(R(n)).
+ </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.
+ </li>
</ul></div>
-<a name="reference_list_of_replace_data_iterator_data"></a>
- 
-<pre class="programlisting">template< class CompatibleData >
+<a name="reference_list_of_replace_data_iterator_data"></a><pre class="programlisting">template< class CompatibleData >
bool replace_data(iterator position, const CompatibleData & x);
</pre>
<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 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 replacing is allowed by all other views of
- the <code class="computeroutput">bimap</code>.
- </li>
-<li class="listitem">
-Postconditions: Validity of position
- is preserved in all cases.
- </li>
-<li class="listitem">
-Returns: <code class="computeroutput">true</code>
- if the replacement took place, <code class="computeroutput">false</code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
- O(R(n)).
- </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.
- </li>
+ 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 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 replacing is allowed by all other views
+ of the <code class="computeroutput">bimap</code>.
+ </li>
+<li class="listitem">
+ Postconditions: Validity of position
+ is preserved in all cases.
+ </li>
+<li class="listitem">
+ Returns: <code class="computeroutput">true</code>
+ if the replacement took place, <code class="computeroutput">false</code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
+ O(R(n)).
+ </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.
+ </li>
</ul></div>
-<a name="reference_list_of_modify_key_iterator_modifier"></a>
- 
-<pre class="programlisting">template< class KeyModifier >
+<a name="reference_list_of_modify_key_iterator_modifier"></a><pre class="programlisting">template< class KeyModifier >
bool modify_key(iterator position, KeyModifier mod);
</pre>
<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 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 class="listitem">
-Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
- succeeds.
- </li>
-<li class="listitem">
-Returns: <code class="computeroutput">true</code>
- if the operation succeeded, <code class="computeroutput">false</code>
- otherwise.
- </li>
+ 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 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 class="listitem">
+ Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
+ succeeds.
+ </li>
+<li class="listitem">
+ Returns: <code class="computeroutput">true</code>
+ if the operation succeeded, <code class="computeroutput">false</code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
+ O(M(n)).
+ </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 class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
- O(M(n)).
- </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 class="listitem">
-Note: Only provided for map views.
- </li>
+ 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 >
+<a name="reference_list_of_modify_data_iterator_modifier"></a><pre class="programlisting">template< class DataModifier >
bool modify_data(iterator position, DataModifier mod);
</pre>
<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 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 class="listitem">
-Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
- succeeds.
- </li>
-<li class="listitem">
-Returns: <code class="computeroutput">true</code>
- if the operation succeeded, <code class="computeroutput">false</code>
- otherwise.
- </li>
+ 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 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 class="listitem">
+ Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
+ succeeds.
+ </li>
+<li class="listitem">
+ Returns: <code class="computeroutput">true</code>
+ if the operation succeeded, <code class="computeroutput">false</code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
+ O(M(n)).
+ </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 class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature">Complexity:</a>
- O(M(n)).
- </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 class="listitem">
-Note: Only provided for map views.
- </li>
+ Note: Only provided for map views.
+ </li>
</ul></div>
</div>
-<div class="section" title="List operations">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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>
@@ -836,319 +809,299 @@
 of the operations may depend on the other views belonging to the same
 <code class="computeroutput">bimap</code>.
 
-<a name="reference_list_of_splice_iterator_this"></a>
- 
-<pre class="programlisting">void splice(iterator position, this_type & x);
+<a name="reference_list_of_splice_iterator_this"></a><pre class="programlisting">void splice(iterator position, this_type & x);
</pre>
<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>
+ Requires: <code class="computeroutput">position</code>
+ is a valid iterator of the view. <code class="computeroutput">&x!=this</code>.
+ </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>
+ 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 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>
+ <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 class="listitem">
-Exception safety: Basic.
- </li>
+ 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);
+<a name="reference_list_of_splice_iterator_this_iterator"></a><pre class="programlisting">void splice(iterator position, this_type & x,iterator i);
</pre>
<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>
+ 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 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>
+ 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 class="listitem">
-Postconditions: If <code class="computeroutput">&x==this</code>, no iterator or reference is invalidated.
- </li>
+ Postconditions: If <code class="computeroutput">&x==this</code>,
+ no iterator or reference is invalidated.
+ </li>
<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>
+ <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 class="listitem">
-Exception safety: If <code class="computeroutput">&x==this</code>,
- nothrow; otherwise, strong.
- </li>
+ 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);
+<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>
<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>. last
- is reachable from <code class="computeroutput">first</code>.
- position is not in the range <code class="computeroutput">[first,last)</code>.
- </li>
+ 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>. last
+ is reachable from <code class="computeroutput">first</code>.
+ position is not in the range <code class="computeroutput">[first,last)</code>.
+ </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>
+ 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 class="listitem">
-Postconditions: If <code class="computeroutput">&x==this</code>, no iterator or reference is invalidated.
- </li>
+ Postconditions: If <code class="computeroutput">&x==this</code>,
+ no iterator or reference is invalidated.
+ </li>
<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>
+ <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 class="listitem">
-Exception safety: If <code class="computeroutput">&x==this</code>,
- nothrow; otherwise, basic.
- </li>
+ 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);
+<a name="reference_list_of_remove_value"></a><pre class="programlisting">void remove(const value_type & value);
</pre>
<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>
+ Effects: Erases all elements of
+ the view which compare equal to <code class="computeroutput">value</code>.
+ </li>
<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>
+ <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 class="listitem">
-Exception safety: Basic.
- </li>
+ Exception safety: Basic.
+ </li>
</ul></div>
-<a name="reference_list_of_remove_if_predicate"></a>
- 
-<pre class="programlisting">template< class Predicate >
+<a name="reference_list_of_remove_if_predicate"></a><pre class="programlisting">template< class Predicate >
void remove_if(Predicate pred);
</pre>
<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>
+ Effects: Erases all elements <code class="computeroutput">x</code> of the view for which <code class="computeroutput">pred(x)</code>
+ holds.
+ </li>
<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>
+ <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 class="listitem">
-Exception safety: Basic.
- </li>
+ Exception safety: Basic.
+ </li>
</ul></div>
-<a name="reference_list_of_unique"></a>
- 
-<pre class="programlisting">void unique();
+<a name="reference_list_of_unique"></a><pre class="programlisting">void unique();
</pre>
<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>
+ 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 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>
+ <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 class="listitem">
-Exception safety: Basic.
- </li>
+ Exception safety: Basic.
+ </li>
</ul></div>
-<a name="reference_list_of_unique_predicate"></a>
- 
-<pre class="programlisting">template< class BinaryPredicate >
+<a name="reference_list_of_unique_predicate"></a><pre class="programlisting">template< class BinaryPredicate >
void unique(BinaryPredicate binary_pred);
</pre>
<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 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 class="listitem">
-Exception safety: Basic.
- </li>
-</ul></div>
-<a name="reference_list_of_merge_this"></a>
- 
-<pre class="programlisting">void merge(this_type & x);
+ 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 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 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>
<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 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
- 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 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 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 class="listitem">
-Exception safety: If <code class="computeroutput">&x==this</code>,
- nothrow; otherwise, basic.
- </li>
+ 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 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 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 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 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 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 >
+<a name="reference_list_of_merge_this_compare"></a><pre class="programlisting">template< class Compare >
void merge(this_type & x, Compare comp);
</pre>
<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 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>).
- 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 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 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 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();
+ 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 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>). 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 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 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 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>
<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 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 class="listitem">
-Postconditions: Validity of iterators
- and references is preserved.
- </li>
-<li class="listitem">
-Complexity: O(n*log(n)).
- </li>
-<li class="listitem">
-Exception safety: nothrow if <code class="computeroutput">std::less<value_type></code>
- does not throw; otherwise, basic.
- </li>
+ 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 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 class="listitem">
+ Postconditions: Validity of iterators
+ and references is preserved.
+ </li>
+<li class="listitem">
+ Complexity: O(n*log(n)).
+ </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 >
+<a name="reference_list_of_sort_compare"></a><pre class="programlisting">template< typename Compare >
void sort(Compare comp);
</pre>
<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>
+ 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 class="listitem">
-Effects: Sorts the view according
- to comp. The sorting is stable, i.e. equivalent elements preserve their
- relative position.
- </li>
+ Effects: Sorts the view according
+ to comp. The sorting is stable, i.e. equivalent elements preserve
+ their relative position.
+ </li>
<li class="listitem">
-Postconditions: Validity of iterators
- and references is preserved.
- </li>
+ Postconditions: Validity of iterators
+ and references is preserved.
+ </li>
<li class="listitem">
-Complexity: O(n*log(n)).
- </li>
+ Complexity: O(n*log(n)).
+ </li>
<li class="listitem">
-Exception safety: nothrow if comp
- does not throw; otherwise, basic.
- </li>
+ 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();
+<a name="reference_list_of_reverse"></a><pre class="programlisting">void reverse();
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-Effects: Reverses the order of the
- elements in the view.
- </li>
+ Effects: Reverses the order of the
+ elements in the view.
+ </li>
<li class="listitem">
-Postconditions: Validity of iterators
- and references is preserved.
- </li>
+ Postconditions: Validity of iterators
+ and references is preserved.
+ </li>
<li class="listitem">
-Complexity: O(n).
- </li>
+ Complexity: O(n).
+ </li>
<li class="listitem">
-Exception safety: nothrow.
- </li>
+ Exception safety: nothrow.
+ </li>
</ul></div>
</div>
-<div class="section" title="Rearrange operations">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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>
@@ -1158,62 +1111,59 @@
 (although splice provides partially overlapping functionality), perform
 individual and global repositioning of elements inside the index.
 
-<a name="reference_list_of_relocate_iterator_iterator"></a>
- 
-<pre class="programlisting">void relocate(iterator position, iterator i);
+<a name="reference_list_of_relocate_iterator_iterator"></a><pre class="programlisting">void relocate(iterator position, iterator i);
</pre>
<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>
+ 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 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>
+ 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 class="listitem">
-Postconditions: No iterator or reference
- is invalidated.
- </li>
+ Postconditions: No iterator or reference
+ is invalidated.
+ </li>
<li class="listitem">
-Complexity: Constant.
- </li>
+ Complexity: Constant.
+ </li>
<li class="listitem">
-Exception safety: nothrow.
- </li>
+ 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);
+<a name="reference_list_of_relocate_iterator_iterator_iterator"></a><pre class="programlisting">void relocate(iterator position, iterator first, iterator last);
</pre>
<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 the view. <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>
+ 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 the view. <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 class="listitem">
-Effects: The range of elements <code class="computeroutput">[first,last)</code> is repositioned just before <code class="computeroutput">position</code>.
- </li>
+ Effects: The range of elements
+ <code class="computeroutput">[first,last)</code> is repositioned just before <code class="computeroutput">position</code>.
+ </li>
<li class="listitem">
-Postconditions: No iterator or reference
- is invalidated.
- </li>
+ Postconditions: No iterator or reference
+ is invalidated.
+ </li>
<li class="listitem">
-Complexity: Constant.
- </li>
+ Complexity: Constant.
+ </li>
<li class="listitem">
-Exception safety: nothrow.
- </li>
+ Exception safety: nothrow.
+ </li>
</ul></div>
</div>
-<div class="section" title="Serialization">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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>
@@ -1233,9 +1183,9 @@
 
</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>
+ Requires: No additional requirements
+ to those imposed by the container.
+ </li></ul></div>
<div class="sidebar">


@@ -1244,16 +1194,14 @@
 
</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(),
- end())</code>
- is a restored copy of the corresponding element in <code class="computeroutput">[m.get<i>().begin(),
- m.get<i>().end())</code>,
- where <code class="computeroutput">i</code> is the position
- of the <code class="computeroutput">list_of</code> view
- in the container.
- </li></ul></div>
+ Requires: No additional requirements
+ to those imposed by the container. Postconditions:
+ On successful loading, each of the elements of <code class="computeroutput">[begin(),
+ end())</code>
+ is a restored copy of the corresponding element in <code class="computeroutput">[m.get<i>().begin(), m.get<i>().end())</code>, where <code class="computeroutput">i</code>
+ is the position of the <code class="computeroutput">list_of</code>
+ view in the container.
+ </li></ul></div>
<div class="sidebar">


@@ -1262,10 +1210,10 @@
 
</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>
+ 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">


@@ -1276,23 +1224,23 @@
</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 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.
- </li>
+ 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 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.
+ </li>
</ul></div>
</div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -1300,7 +1248,7 @@
</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>
+<a accesskey="p" href="unordered_set_of_reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="vector_of_reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>set_of Reference</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<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">
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="bimap_reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unordered_set_of_reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="set_of Reference">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<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>
@@ -52,7 +52,7 @@
<dt>Serialization</dt>
</dl></dd>
</dl></div>
-<div class="section" title='Header "boost/bimap/set_of.hpp" synopsis'>
+<div class="section">
<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 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>
@@ -80,7 +80,7 @@
} // namespace boost
</pre>
</div>
-<div class="section" title='Header "boost/bimap/multiset_of.hpp" synopsis'>
+<div class="section">
<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 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>
@@ -108,7 +108,7 @@
} // namespace boost
</pre>
</div>
-<div class="section" title="Collection type specifiers set_of and multiset_of">
+<div class="section">
<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 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>
@@ -119,7 +119,7 @@
 coincide, so they are described together.
 
</div>
-<div class="section" title="[multi]set_of Views">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<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>
@@ -372,9 +372,7 @@

typedef signature-compatible with std::pair< ... ,const Left > value_type;
</pre>
-<a name="set_of_complexity_signature"></a>
- 
-<div class="section" title="Complexity signature">
+<a name="set_of_complexity_signature"></a><div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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>
@@ -387,33 +385,31 @@
 
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- copying: <code class="computeroutput">c(n) = n * log(n)</code>,
- </li>
+ copying: <code class="computeroutput">c(n) = n * log(n)</code>,
+ </li>
<li class="listitem">
- insertion: <code class="computeroutput">i(n) = log(n)</code>,
- </li>
+ insertion: <code class="computeroutput">i(n) = log(n)</code>,
+ </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 class="listitem">
- deletion: <code class="computeroutput">d(n) = 1</code> (amortized
- constant),
- </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 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>
+ 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 class="listitem">
+ deletion: <code class="computeroutput">d(n) = 1</code>
+ (amortized constant),
+ </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 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" title="Instantiation types">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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>
@@ -424,23 +420,23 @@
 
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<code class="computeroutput">Value</code> from the set
- specifier,
- </li>
-<li class="listitem">
-<code class="computeroutput">Allocator</code> from <code class="computeroutput">bimap</code>,
- </li>
-<li class="listitem">
-<code class="computeroutput">Compare</code> from the set
- specifier.
- </li>
+ <code class="computeroutput">Value</code> from the set
+ specifier,
+ </li>
+<li class="listitem">
+ <code class="computeroutput">Allocator</code> from <code class="computeroutput">bimap</code>,
+ </li>
+<li class="listitem">
+ <code class="computeroutput">Compare</code> from the
+ set specifier.
+ </li>
</ul></div>

 <code class="computeroutput">Compare</code> is a <a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html" target="_top">Strict
 Weak Ordering</a> on elements of <code class="computeroutput">Value</code>.
 
</div>
-<div class="section" title="Constructors, copy and assignment">
+<div class="section">
<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 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>
@@ -453,436 +449,420 @@
</pre>
<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>
+ 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 class="listitem">
-Returns: <code class="computeroutput">*this</code>.
- </li>
+ Returns: <code class="computeroutput">*this</code>.
+ </li>
</ul></div>
</div>
-<div class="section" title="Modifiers">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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);
+<a name="reference_set_of_insert_value"></a><pre class="programlisting">std::pair<iterator,bool> insert(const value_type & x);
</pre>
<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 class="itemizedlist" type="circle">
+ 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 class="itemizedlist" type="circle">
<li class="listitem">
- the set view is non-unique OR no other element with equivalent
- key exists,
- </li>
+ the set view is non-unique OR no other element with equivalent
+ key exists,
+ </li>
<li class="listitem">
- AND insertion is allowed by the other set specifications the <code class="computeroutput">bimap</code>.
- </li>
+ 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
- insertion took place. On successful insertion, <code class="computeroutput">p.first</code>
- points to the element inserted; otherwise, <code class="computeroutput">p.first</code>
- points to an element that caused the insertion to be banned. Note that
- more than one element can be causing insertion not to be allowed.
- </li>
+ 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 insertion took place. On successful insertion, <code class="computeroutput">p.first</code> points to the element inserted;
+ otherwise, <code class="computeroutput">p.first</code> points to an element that
+ caused the insertion to be banned. Note that more than one element
+ can be causing insertion not to be allowed.
+ </li>
<li class="listitem">
-<a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
- O(I(n)).
- </li>
+ <a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
+ O(I(n)).
+ </li>
<li class="listitem">
-Exception safety: Strong.
- </li>
+ 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);
+<a name="reference_set_of_insert_iterator_value"></a><pre class="programlisting">iterator insert(iterator position, const value_type & x);
</pre>
<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>
+ Requires: <code class="computeroutput">position</code>
+ is a valid iterator of the view.
+ </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 class="itemizedlist" type="circle">
+ 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 class="itemizedlist" type="circle">
<li class="listitem">
- the set view is non-unique OR no other element with equivalent
- key exists,
- </li>
+ the set view is non-unique OR no other element with equivalent
+ key exists,
+ </li>
<li class="listitem">
- AND insertion is allowed by all other views of the <code class="computeroutput">bimap</code>.
- </li>
+ 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>
+ 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 class="listitem">
-<a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
- O(H(n)).
- </li>
+ <a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
+ O(H(n)).
+ </li>
<li class="listitem">
-Exception safety: Strong.
- </li>
+ Exception safety: Strong.
+ </li>
</ul></div>
-<a name="reference_set_of_insert_iterator_iterator"></a>
- 
-<pre class="programlisting">template< class InputIterator >
+<a name="reference_set_of_insert_iterator_iterator"></a><pre class="programlisting">template< class InputIterator >
void insert(InputIterator first, InputIterator last);
</pre>
<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>
- or a type convertible to value_type. <code class="computeroutput">first</code>
- and <code class="computeroutput">last</code> are not iterators
- into any view of the <code class="computeroutput">bimap</code>
- to which this index belongs. <code class="computeroutput">last</code>
- is reachable from <code class="computeroutput">first</code>.
- </li>
-<li class="listitem">
-Effects: <code class="computeroutput">iterator
- hint =
- end()</code>;
- <code class="computeroutput">while(
- first !=
- last )
- hint =
- insert(
- hint,
- *first++ );</code>
-</li>
-<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 class="listitem">
-Exception safety: Basic.
- </li>
-</ul></div>
-<a name="reference_set_of_erase_iterator"></a>
- 
-<pre class="programlisting">iterator erase(iterator position);
+ 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>
+ or a type convertible to value_type. <code class="computeroutput">first</code>
+ and <code class="computeroutput">last</code> are not
+ iterators into any view of the <code class="computeroutput">bimap</code>
+ to which this index belongs. <code class="computeroutput">last</code>
+ is reachable from <code class="computeroutput">first</code>.
+ </li>
+<li class="listitem">
+ Effects: <code class="computeroutput">iterator
+ hint =
+ end()</code>;
+ <code class="computeroutput">while(
+ first !=
+ last )
+ hint =
+ insert(
+ hint,
+ *first++ );</code>
+ </li>
+<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 class="listitem">
+ Exception safety: Basic.
+ </li>
+</ul></div>
+<a name="reference_set_of_erase_iterator"></a><pre class="programlisting">iterator erase(iterator position);
</pre>
<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>
+ Requires: <code class="computeroutput">position</code>
+ is a valid dereferenceable iterator if the set view.
+ </li>
+<li class="listitem">
+ Effects: Deletes the element pointed
+ to by <code class="computeroutput">position</code>.
+ </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 class="listitem">
+ <a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
+ O(D(n)).
+ </li>
<li class="listitem">
-Effects: Deletes the element pointed
- to by <code class="computeroutput">position</code>.
- </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 class="listitem">
-<a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
- O(D(n)).
- </li>
-<li class="listitem">
-Exception safety: nothrow.
- </li>
+ Exception safety: nothrow.
+ </li>
</ul></div>
-<a name="reference_set_of_erase_key"></a>
- 
-<pre class="programlisting">template< class CompatibleKey >
+<a name="reference_set_of_erase_key"></a><pre class="programlisting">template< class CompatibleKey >
size_type erase(const CompatibleKey & x);
</pre>
<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>
+ Requires: <code class="computeroutput">CompatibleKey</code>
+ is a compatible key of <code class="computeroutput">key_compare</code>.
+ </li>
<li class="listitem">
-Effects: Deletes the elements with
- key equivalent to <code class="computeroutput">x</code>.
- </li>
+ Effects: Deletes the elements with
+ key equivalent to <code class="computeroutput">x</code>.
+ </li>
<li class="listitem">
-Returns: Number of elements deleted.
- </li>
+ Returns: Number of elements deleted.
+ </li>
<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>
+ <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 class="listitem">
-Exception safety: Basic.
- </li>
+ Exception safety: Basic.
+ </li>
</ul></div>
-<a name="reference_set_of_erase_iterator_iterator"></a>
- 
-<pre class="programlisting">iterator erase(iterator first, iterator last);
+<a name="reference_set_of_erase_iterator_iterator"></a><pre class="programlisting">iterator erase(iterator first, iterator last);
</pre>
<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>
+ Requires: <code class="computeroutput">[first,last)</code>
+ is a valid range of the view.
+ </li>
<li class="listitem">
-Effects: Deletes the elements in
- <code class="computeroutput">[first,last)</code>.
- </li>
+ Effects: Deletes the elements in
+ <code class="computeroutput">[first,last)</code>.
+ </li>
<li class="listitem">
-Returns: last.
- </li>
+ Returns: last.
+ </li>
<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>
+ <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 class="listitem">
-Exception safety: nothrow.
- </li>
+ 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);
+<a name="reference_set_of_replace_iterator_value"></a><pre class="programlisting">bool replace(iterator position, const value_type& x);
</pre>
<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>
+ Requires: <code class="computeroutput">position</code>
+ is a valid dereferenceable iterator of the set view.
+ </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 class="itemizedlist" type="circle">
+ 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 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>
+ the set view is non-unique OR no other element with equivalent
+ key exists (except possibly <code class="computeroutput">*position</code>),
+ </li>
<li class="listitem">
- AND replacing is allowed by all other views of the <code class="computeroutput">bimap</code>.
- </li>
+ 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>
+ Postconditions: Validity of position
+ is preserved in all cases.
+ </li>
<li class="listitem">
-Returns: <code class="computeroutput">true</code>
- if the replacement took place, <code class="computeroutput">false</code>
- otherwise.
- </li>
+ Returns: <code class="computeroutput">true</code>
+ if the replacement took place, <code class="computeroutput">false</code>
+ otherwise.
+ </li>
<li class="listitem">
-<a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
- O(R(n)).
- </li>
+ <a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
+ O(R(n)).
+ </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.
- </li>
+ 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.
+ </li>
</ul></div>
-<a name="reference_set_of_replace_key_iterator_key"></a>
- 
-<pre class="programlisting">template< class CompatibleKey >
+<a name="reference_set_of_replace_key_iterator_key"></a><pre class="programlisting">template< class CompatibleKey >
bool replace_key(iterator position, const CompatibleKey & x);
</pre>
<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 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 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 class="listitem">
- AND replacing is allowed by all other views of the <code class="computeroutput">bimap</code>.
- </li>
-</ul></div>
-</li>
-<li class="listitem">
-Postconditions: Validity of position
- is preserved in all cases.
- </li>
-<li class="listitem">
-Returns: <code class="computeroutput">true</code>
- if the replacement took place, <code class="computeroutput">false</code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
- O(R(n)).
- </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.
- </li>
+ 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 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 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 class="listitem">
+ AND replacing is allowed by all other views of the <code class="computeroutput">bimap</code>.
+ </li>
+</ul></div>
+ </li>
+<li class="listitem">
+ Postconditions: Validity of position
+ is preserved in all cases.
+ </li>
+<li class="listitem">
+ Returns: <code class="computeroutput">true</code>
+ if the replacement took place, <code class="computeroutput">false</code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
+ O(R(n)).
+ </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.
+ </li>
</ul></div>
-<a name="reference_set_of_replace_data_iterator_data"></a>
- 
-<pre class="programlisting">template< class CompatibleData >
+<a name="reference_set_of_replace_data_iterator_data"></a><pre class="programlisting">template< class CompatibleData >
bool replace_data(iterator position, const CompatibleData & x);
</pre>
<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 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 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 class="listitem">
- AND replacing is allowed by all other views of the <code class="computeroutput">bimap</code>.
- </li>
-</ul></div>
-</li>
-<li class="listitem">
-Postconditions: Validity of position
- is preserved in all cases.
- </li>
-<li class="listitem">
-Returns: <code class="computeroutput">true</code>
- if the replacement took place, <code class="computeroutput">false</code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
- O(R(n)).
- </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.
- </li>
+ 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 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 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 class="listitem">
+ AND replacing is allowed by all other views of the <code class="computeroutput">bimap</code>.
+ </li>
+</ul></div>
+ </li>
+<li class="listitem">
+ Postconditions: Validity of position
+ is preserved in all cases.
+ </li>
+<li class="listitem">
+ Returns: <code class="computeroutput">true</code>
+ if the replacement took place, <code class="computeroutput">false</code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
+ O(R(n)).
+ </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.
+ </li>
</ul></div>
-<a name="reference_set_of_modify_key_iterator_modifier"></a>
- 
-<pre class="programlisting">template< class KeyModifier >
+<a name="reference_set_of_modify_key_iterator_modifier"></a><pre class="programlisting">template< class KeyModifier >
bool modify_key(iterator position, KeyModifier mod);
</pre>
<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 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 class="itemizedlist" type="circle">
-<li class="listitem">
- the map view is non-unique OR no other element with equivalent
- key exists,
- </li>
-<li class="listitem">
- AND rearrangement is allowed by all other views of the <code class="computeroutput">bimap</code>.
- </li>
-</ul></div>
-</li>
-<li class="listitem">
-Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
- succeeds.
- </li>
-<li class="listitem">
-Returns: <code class="computeroutput">true</code>
- if the operation succeeded, <code class="computeroutput">false</code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
- O(M(n)).
- </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>
+ 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 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 class="itemizedlist" type="circle">
+<li class="listitem">
+ the map view is non-unique OR no other element with equivalent
+ key exists,
+ </li>
+<li class="listitem">
+ AND rearrangement is allowed by all other views of the <code class="computeroutput">bimap</code>.
+ </li>
+</ul></div>
+ </li>
+<li class="listitem">
+ Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
+ succeeds.
+ </li>
+<li class="listitem">
+ Returns: <code class="computeroutput">true</code>
+ if the operation succeeded, <code class="computeroutput">false</code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
+ O(M(n)).
+ </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 class="listitem">
-Note: Only provided for map views.
- </li>
+ 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 >
+<a name="reference_set_of_modify_data_iterator_modifier"></a><pre class="programlisting">template< class DataModifier >
bool modify_data(iterator position, DataModifier mod);
</pre>
<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 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 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 class="listitem">
- AND rearrangement is allowed by all other views of the <code class="computeroutput">bimap</code>.
- </li>
-</ul></div>
-</li>
-<li class="listitem">
-Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
- succeeds.
- </li>
-<li class="listitem">
-Returns: <code class="computeroutput">true</code>
- if the operation succeeded, <code class="computeroutput">false</code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
- O(M(n)).
- </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>
+ 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 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 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 class="listitem">
+ AND rearrangement is allowed by all other views of the <code class="computeroutput">bimap</code>.
+ </li>
+</ul></div>
+ </li>
+<li class="listitem">
+ Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
+ succeeds.
+ </li>
+<li class="listitem">
+ Returns: <code class="computeroutput">true</code>
+ if the operation succeeded, <code class="computeroutput">false</code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="set_of_reference.html#set_of_complexity_signature">Complexity:</a>
+ O(M(n)).
+ </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 class="listitem">
-Note: Only provided for map views.
- </li>
+ Note: Only provided for map views.
+ </li>
</ul></div>
</div>
-<div class="section" title="Set operations">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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>
@@ -906,9 +886,7 @@
 as well as being a strict weak ordering, accepts arguments of type <code class="computeroutput">CompatibleKey</code>, which usually means
 it has several overloads of <code class="computeroutput">operator()</code>.
 
-<a name="reference_set_of_find_key"></a>
- 
-<pre class="programlisting">template< class CompatibleKey >
+<a name="reference_set_of_find_key"></a><pre class="programlisting">template< class CompatibleKey >
iterator find(const CompatibleKey & x);

template< class CompatibleKey >
@@ -916,40 +894,36 @@
</pre>
<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 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>
+ Requires: <code class="computeroutput">CompatibleKey</code>
+ is a compatible key of <code class="computeroutput">key_compare</code>.
+ </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 class="listitem">
-Complexity: O(log(n)).
- </li>
+ Complexity: O(log(n)).
+ </li>
</ul></div>
-<a name="reference_set_of_count_key"></a>
- 
-<pre class="programlisting">template< class CompatibleKey >
+<a name="reference_set_of_count_key"></a><pre class="programlisting">template< class CompatibleKey >
size_type count(const key_type & x) const;
</pre>
<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 class="listitem">
-Effects: Returns the number of elements
- with key equivalent to <code class="computeroutput">x</code>.
- </li>
+ Requires: <code class="computeroutput">CompatibleKey</code>
+ is a compatible key of <code class="computeroutput">key_compare</code>.
+ </li>
+<li class="listitem">
+ Effects: Returns the number of elements
+ with key equivalent to <code class="computeroutput">x</code>.
+ </li>
<li class="listitem">
-Complexity: O(log(n) + count(x)).
- </li>
+ Complexity: O(log(n) + count(x)).
+ </li>
</ul></div>
-<a name="reference_set_of_lower_bound_key"></a>
- 
-<pre class="programlisting">template< class CompatibleKey >
+<a name="reference_set_of_lower_bound_key"></a><pre class="programlisting">template< class CompatibleKey >
iterator lower_bound(const key_type & x);

template< class CompatibleKey >
@@ -957,22 +931,20 @@
</pre>
<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 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>
+ Requires: <code class="computeroutput">CompatibleKey</code>
+ is a compatible key of <code class="computeroutput">key_compare</code>.
+ </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 class="listitem">
-Complexity: O(log(n)).
- </li>
+ Complexity: O(log(n)).
+ </li>
</ul></div>
-<a name="reference_set_of_upper_bound_key"></a>
- 
-<pre class="programlisting">template< class CompatibleKey >
+<a name="reference_set_of_upper_bound_key"></a><pre class="programlisting">template< class CompatibleKey >
iterator upper_bound(const key_type & x);

template< class CompatibleKey >
@@ -980,22 +952,20 @@
</pre>
<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 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>
+ Requires: <code class="computeroutput">CompatibleKey</code>
+ is a compatible key of <code class="computeroutput">key_compare</code>.
+ </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 class="listitem">
-Complexity: O(log(n)).
- </li>
+ Complexity: O(log(n)).
+ </li>
</ul></div>
-<a name="reference_set_of_equal_range_key"></a>
- 
-<pre class="programlisting">template< class CompatibleKey >
+<a name="reference_set_of_equal_range_key"></a><pre class="programlisting">template< class CompatibleKey >
std::pair<iterator,iterator>
 equal_range(const key_type & x);

@@ -1005,18 +975,18 @@
</pre>
<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>
+ Requires: <code class="computeroutput">CompatibleKey</code>
+ is a compatible key of <code class="computeroutput">key_compare</code>.
+ </li>
<li class="listitem">
-Effects: Equivalent to <code class="computeroutput">make_pair(lower_bound(x),upper_bound(x))</code>.
- </li>
+ Effects: Equivalent to <code class="computeroutput">make_pair(lower_bound(x),upper_bound(x))</code>.
+ </li>
<li class="listitem">
-Complexity: O(log(n)).
- </li>
+ Complexity: O(log(n)).
+ </li>
</ul></div>
</div>
-<div class="section" title="Range operations">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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>
@@ -1037,13 +1007,13 @@
 
<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 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>
+ <code class="computeroutput">LowerBounder</code> is a
+ <code class="computeroutput">Predicate</code> over <code class="computeroutput">Key</code>,
+ </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>
</ul></div>

 for every <code class="computeroutput">lower</code> of type
@@ -1054,80 +1024,77 @@
 
<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 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>
+ <code class="computeroutput">UpperBounder</code> is a
+ <code class="computeroutput">Predicate</code> over <code class="computeroutput">Key</code>,
+ </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>
</ul></div>

 for every <code class="computeroutput">upper</code> of type
 <code class="computeroutput">UpperBounder</code>, <code class="computeroutput">comp</code> of type <code class="computeroutput">Compare</code>,
 and <code class="computeroutput">k1</code>, <code class="computeroutput">k2</code> of type <code class="computeroutput">Key</code>.
 
-<a name="reference_set_of_range_lower_upper"></a>
- 
-<pre class="programlisting">template< class LowerBounder, class UpperBounder>
+<a name="reference_set_of_range_lower_upper"></a><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 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 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 class="listitem">
-Complexity: O(log(n)).
- </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>
+ 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 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 class="listitem">
+ Complexity: O(log(n)).
+ </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 class="listitem">
-Note: Only provided for map views.
- </li>
+ Note: Only provided for map views.
+ </li>
</ul></div>
</div>
-<div class="section" title="at(), info_at() and operator[] - set_of only">
+<div class="section">
<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 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 >
+<a name="reference_set_of_at_key_const"></a><pre class="programlisting">template< class CompatibleKey >
const data_type & at(const CompatibleKey & k) const;
</pre>
<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 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>
+ Requires: <code class="computeroutput">CompatibleKey</code>
+ is a compatible key of <code class="computeroutput">key_compare</code>.
+ </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 class="listitem">
-Complexity: O(log(n)).
- </li>
+ Complexity: O(log(n)).
+ </li>
<li class="listitem">
-Note: Only provided when <code class="computeroutput">set_of</code> is used.
- </li>
+ Note: Only provided when <code class="computeroutput">set_of</code> is used.
+ </li>
</ul></div>

 The symmetry of bimap imposes some constraints on <code class="computeroutput">operator[]</code> and the non constant version of at()
@@ -1135,55 +1102,49 @@
 Tey are only provided if the other collection type is mutable (<code class="computeroutput">list_of</code>, <code class="computeroutput">vector_of</code>
 and <code class="computeroutput">unconstrained_set_of</code>).
 
-<a name="reference_set_of_operator_bracket_key"></a>
- 
-<pre class="programlisting">template< class CompatibleKey >
+<a name="reference_set_of_operator_bracket_key"></a><pre class="programlisting">template< class CompatibleKey >
data_type & operator[](const CompatibleKey & k);
</pre>
<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 class="listitem">
-Effects: <code class="computeroutput">return
- insert(value_type(k,data_type()))->second;</code>
-</li>
-<li class="listitem">
-Complexity: O(log(n)).
- </li>
-<li class="listitem">
-Note: Only provided when <code class="computeroutput">set_of</code> is used and the other collection
- type is mutable.
- </li>
+ Requires: <code class="computeroutput">CompatibleKey</code>
+ is a compatible key of <code class="computeroutput">key_compare</code>.
+ </li>
+<li class="listitem">
+ Effects: <code class="computeroutput">return
+ insert(value_type(k,data_type()))->second;</code>
+ </li>
+<li class="listitem">
+ Complexity: O(log(n)).
+ </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 >
+<a name="reference_set_of_at_key"></a><pre class="programlisting">template< class CompatibleKey >
data_type & at(const CompatibleKey & k);
</pre>
<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 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 class="listitem">
-Complexity: O(log(n)).
- </li>
-<li class="listitem">
-Note: Only provided when <code class="computeroutput">set_of</code> is used and the other collection
- type is mutable.
- </li>
+ Requires: <code class="computeroutput">CompatibleKey</code>
+ is a compatible key of <code class="computeroutput">key_compare</code>.
+ </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 class="listitem">
+ Complexity: O(log(n)).
+ </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 >
+<a name="reference_set_of_info_at_key"></a><pre class="programlisting">template< class CompatibleKey >
info_type & info_at(const CompatibleKey & k);

template< class CompatibleKey >
@@ -1191,25 +1152,25 @@
</pre>
<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 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 class="listitem">
-Complexity: O(log(n)).
- </li>
-<li class="listitem">
-Note: Only provided when <code class="computeroutput">set_of</code> and <code class="computeroutput">info_hook</code>
- are used
- </li>
+ Requires: <code class="computeroutput">CompatibleKey</code>
+ is a compatible key of <code class="computeroutput">key_compare</code>.
+ </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 class="listitem">
+ Complexity: O(log(n)).
+ </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" title="Serialization">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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>
@@ -1229,9 +1190,9 @@
 
</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>
+ Requires: No additional requirements
+ to those imposed by the container.
+ </li></ul></div>
<div class="sidebar">


@@ -1241,18 +1202,17 @@
</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 class="listitem">
-Postconditions: On successful loading,
- each of the elements of <code class="computeroutput">[begin(),
- end())</code>
- is a restored copy of the corresponding element in <code class="computeroutput">[m.get<i>().begin(),
- m.get<i>().end())</code>.
- </li>
+ 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 class="listitem">
+ Postconditions: On successful loading,
+ each of the elements of <code class="computeroutput">[begin(),
+ end())</code>
+ is a restored copy of the corresponding element in <code class="computeroutput">[m.get<i>().begin(), m.get<i>().end())</code>.
+ </li>
</ul></div>
<div class="sidebar">

@@ -1263,10 +1223,10 @@
 
</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>
+ 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">


@@ -1277,24 +1237,24 @@
</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 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
- iterator, or viceversa.
- </li>
+ 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 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 iterator, or viceversa.
+ </li>
</ul></div>
</div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -1302,7 +1262,7 @@
</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>
+<a accesskey="p" href="bimap_reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unordered_set_of_reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>unconstrained_set_of Reference</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<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="next" href="../compiler_specifics.html" title="Compiler specifics">
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="vector_of_reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../compiler_specifics.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="unconstrained_set_of Reference">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<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>
@@ -38,7 +38,7 @@
<dt>Serialization</dt>
</dl></dd>
</dl></div>
-<div class="section" title='Header "boost/bimap/unconstrained_set_of.hpp" synopsis'>
+<div class="section">
<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 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>
@@ -57,7 +57,7 @@
} // namespace boost
</pre>
</div>
-<div class="section" title="unconstrained_set_of Views">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<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>
@@ -111,9 +111,7 @@

typedef signature-compatible with std::pair< ... , Left > value_type;
</pre>
-<a name="unconstrained_set_of_complexity_signature"></a>
- 
-<div class="section" title="Complexity signature">
+<a name="unconstrained_set_of_complexity_signature"></a><div class="section">
<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 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>
@@ -126,26 +124,26 @@
 
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- copying: <code class="computeroutput">c(n) = 0</code>
-</li>
+ copying: <code class="computeroutput">c(n) = 0</code>
+ </li>
<li class="listitem">
- insertion: <code class="computeroutput">i(n) = 0</code>
-</li>
+ insertion: <code class="computeroutput">i(n) = 0</code>
+ </li>
<li class="listitem">
- hinted insertion: <code class="computeroutput">h(n) = 0</code>
-</li>
+ hinted insertion: <code class="computeroutput">h(n) = 0</code>
+ </li>
<li class="listitem">
- deletion: <code class="computeroutput">d(n) = 0</code>
-</li>
+ deletion: <code class="computeroutput">d(n) = 0</code>
+ </li>
<li class="listitem">
- replacement: <code class="computeroutput">r(n) = 0</code>
-</li>
+ replacement: <code class="computeroutput">r(n) = 0</code>
+ </li>
<li class="listitem">
- modifying: <code class="computeroutput">m(n) = 0</code>
-</li>
+ modifying: <code class="computeroutput">m(n) = 0</code>
+ </li>
</ul></div>
</div>
-<div class="section" title="Serialization">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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>
@@ -165,9 +163,9 @@
 
</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>
+ Requires: No additional requirements
+ to those imposed by the container.
+ </li></ul></div>
<div class="sidebar">


@@ -176,15 +174,15 @@
 
</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>
+ Requires: No additional requirements
+ to those imposed by the container.
+ </li></ul></div>
</div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -192,7 +190,7 @@
</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>
+<a accesskey="p" href="vector_of_reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../compiler_specifics.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>unordered_set_of Reference</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<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,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="set_of_reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="list_of_reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="unordered_set_of Reference">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<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>
@@ -54,7 +54,7 @@
<dt>Serialization</dt>
</dl></dd>
</dl></div>
-<div class="section" title='Header "boost/bimap/unordered_set_of.hpp" synopsis'>
+<div class="section">
<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 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>
@@ -84,7 +84,7 @@
} // namespace boost
</pre>
</div>
-<div class="section" title='Header "boost/bimap/unordered_multiset_of.hpp" synopsis'>
+<div class="section">
<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 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>
@@ -114,7 +114,7 @@
} // namespace boost
</pre>
</div>
-<div class="section" title="Collection type specifiers unordered_set_of and unordered_multiset_of">
+<div class="section">
<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 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>
@@ -125,7 +125,7 @@
 coincide, thus we describe them in a grouped manner.
 
</div>
-<div class="section" title="unordered_[multi]set_of Views">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<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>
@@ -380,9 +380,7 @@

typedef signature-compatible with std::pair< ... ,const Left > value_type;
</pre>
-<a name="unordered_set_of_complexity_signature"></a>
- 
-<div class="section" title="Complexity signature">
+<a name="unordered_set_of_complexity_signature"></a><div class="section">
<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 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>
@@ -395,37 +393,39 @@
 
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- copying: <code class="computeroutput">c(n) = n * log(n)</code>,
- </li>
+ copying: <code class="computeroutput">c(n) = n * log(n)</code>,
+ </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>
+ insertion: average case <code class="computeroutput">i(n) = 1</code> (constant), worst case <code class="computeroutput">i(n) = n</code>,
+ </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>
+ hinted insertion: average case <code class="computeroutput">h(n) = 1</code> (constant), worst case <code class="computeroutput">h(n) = n</code>,
+ </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>
+ deletion: average case <code class="computeroutput">d(n) = 1</code> (constant), worst case <code class="computeroutput">d(n) = n</code>,
+ </li>
<li class="listitem">
- replacement:
- <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+ replacement:
+ <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>
+ if the new element key is equivalent to the original, <code class="computeroutput">r(n)
+ = 1</code>
+ (constant),
+ </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>
+ 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>
+ 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" title="Instantiation types">
+<div class="section">
<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 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>
@@ -438,19 +438,19 @@
 
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<code class="computeroutput">Value</code> from <code class="computeroutput">bimap</code>,
- </li>
+ <code class="computeroutput">Value</code> from <code class="computeroutput">bimap</code>,
+ </li>
<li class="listitem">
-<code class="computeroutput">Allocator</code> from <code class="computeroutput">bimap</code>,
- </li>
+ <code class="computeroutput">Allocator</code> from <code class="computeroutput">bimap</code>,
+ </li>
<li class="listitem">
-<code class="computeroutput">Hash</code> from the collection
- type specifier,
- </li>
-<li class="listitem">
-<code class="computeroutput">Pred</code> from the collection
- type specifier.
- </li>
+ <code class="computeroutput">Hash</code> from the collection
+ type specifier,
+ </li>
+<li class="listitem">
+ <code class="computeroutput">Pred</code> from the collection
+ type specifier.
+ </li>
</ul></div>

 <code class="computeroutput">Hash</code> is a <a href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">Unary
@@ -462,7 +462,7 @@
 same value for keys equivalent under <code class="computeroutput">Pred</code>.
 
</div>
-<div class="section" title="Nested types">
+<div class="section">
<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 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>
@@ -472,18 +472,12 @@
local_iterator
const_local_iterator
</pre>
-<div class="blockquote"><blockquote class="blockquote">
-
- 
-
- These types are models of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html" target="_top">Forward
- Iterator</a>.
- 
-
- 
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+ These types are models of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html" target="_top">Forward
+ Iterator</a>.
+ </blockquote></div>
</div>
-<div class="section" title="Constructors, copy and assignment">
+<div class="section">
<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 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>
@@ -498,433 +492,418 @@
</pre>
<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>
+ 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 class="listitem">
-Returns: <code class="computeroutput">*this.</code>
-</li>
+ Returns: <code class="computeroutput">*this.</code>
+ </li>
</ul></div>
</div>
-<div class="section" title="Modifiers">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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);
+<a name="reference_unordered_set_of_insert_value"></a><pre class="programlisting">std::pair<iterator,bool> insert(const value_type & x);
</pre>
<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 class="itemizedlist" type="circle">
+ Effects: Inserts <code class="computeroutput">x</code>
+ into the <code class="computeroutput">bimap</code> to
+ which the view belongs if
+ <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>
+ the view is non-unique OR no other element with equivalent
+ key exists,
+ </li>
<li class="listitem">
- AND insertion is allowed by all other views of the <code class="computeroutput">bimap</code>.
- </li>
+ 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
- insertion took place. On successful insertion, <code class="computeroutput">p.first</code>
- points to the element inserted; otherwise, <code class="computeroutput">p.first</code>
- points to an element that caused the insertion to be banned. Note that
- more than one element can be causing insertion not to be allowed.
- </li>
+ 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 insertion took place. On successful insertion, <code class="computeroutput">p.first</code> points to the element inserted;
+ otherwise, <code class="computeroutput">p.first</code> points to an element that
+ caused the insertion to be banned. Note that more than one element
+ can be causing insertion not to be allowed.
+ </li>
<li class="listitem">
-<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
- O(I(n)).
- </li>
+ <a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
+ O(I(n)).
+ </li>
<li class="listitem">
-Exception safety: Strong.
- </li>
+ 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);
+<a name="reference_unordered_set_of_insert_iterator_value"></a><pre class="programlisting">iterator insert(iterator position, const value_type & x);
</pre>
<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>
+ Requires: <code class="computeroutput">position</code>
+ is a valid iterator of the view.
+ </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 class="itemizedlist" type="circle">
+ 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 class="itemizedlist" type="circle">
<li class="listitem">
- the view is non-unique OR no other element with equivalent key
- exists,
- </li>
+ the view is non-unique OR no other element with equivalent
+ key exists,
+ </li>
<li class="listitem">
- AND insertion is allowed by all other views of the <code class="computeroutput">bimap</code>.
- </li>
+ 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>
+ 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 class="listitem">
-<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
- O(H(n)).
- </li>
+ <a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
+ O(H(n)).
+ </li>
<li class="listitem">
-Exception safety: Strong.
- </li>
+ Exception safety: Strong.
+ </li>
</ul></div>
-<a name="reference_unordered_set_of_insert_iterator_iterator"></a>
- 
-<pre class="programlisting">template< class InputIterator>
+<a name="reference_unordered_set_of_insert_iterator_iterator"></a><pre class="programlisting">template< class InputIterator>
void insert(InputIterator first, InputIterator last);
</pre>
<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>.
- <code class="computeroutput">first</code> and <code class="computeroutput">last</code> are not iterators into any views
- of the <code class="computeroutput">bimap</code> to which
- this view belongs. <code class="computeroutput">last</code>
- is reachable from first.
- </li>
-<li class="listitem">
-Effects: <code class="computeroutput">iterator
- hint =
- end();</code><code class="computeroutput">while(first !=
- last)
- hint =
- insert(hint, *first++);</code>
-</li>
-<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 class="listitem">
-Exception safety: Basic.
- </li>
-</ul></div>
-<a name="reference_unordered_set_of_erase_iterator"></a>
- 
-<pre class="programlisting">iterator erase(iterator position);
+ 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>.
+ <code class="computeroutput">first</code> and <code class="computeroutput">last</code> are not iterators into any
+ views of the <code class="computeroutput">bimap</code>
+ to which this view belongs. <code class="computeroutput">last</code>
+ is reachable from first.
+ </li>
+<li class="listitem">
+ Effects: <code class="computeroutput">iterator
+ hint =
+ end();</code>
+ <code class="computeroutput">while(first !=
+ last)
+ hint =
+ insert(hint,
+ *first++);</code>
+ </li>
+<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 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>
<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 class="listitem">
-Effects: Deletes the element pointed
- to by <code class="computeroutput">position</code>.
- </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>
+ Requires: <code class="computeroutput">position</code>
+ is a valid dereferenceable <code class="computeroutput">iterator</code>
+ of the view.
+ </li>
+<li class="listitem">
+ Effects: Deletes the element pointed
+ to by <code class="computeroutput">position</code>.
+ </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 class="listitem">
+ <a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
+ O(D(n)).
+ </li>
<li class="listitem">
-<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
- O(D(n)).
- </li>
-<li class="listitem">
-Exception safety: nothrow.
- </li>
+ Exception safety: nothrow.
+ </li>
</ul></div>
-<a name="reference_unordered_set_of_erase_key"></a>
- 
-<pre class="programlisting">template< class CompatibleKey >
+<a name="reference_unordered_set_of_erase_key"></a><pre class="programlisting">template< class CompatibleKey >
size_type erase(const CompatibleKey & x);
</pre>
<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 class="listitem">
-Returns: Number of elements deleted.
- </li>
-<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>
+ Effects: Deletes the elements with
+ key equivalent to <code class="computeroutput">x</code>.
+ </li>
+<li class="listitem">
+ Returns: Number of elements deleted.
+ </li>
<li class="listitem">
-Exception safety: Basic.
- </li>
+ <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 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);
+<a name="reference_unordered_set_of_erase_iterator_iterator"></a><pre class="programlisting">iterator erase(iterator first, iterator last);
</pre>
<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>
+ Requires: <code class="computeroutput">[first,last)</code>
+ is a valid range of the view.
+ </li>
<li class="listitem">
-Effects: Deletes the elements in
- <code class="computeroutput">[first,last)</code>.
- </li>
+ Effects: Deletes the elements in
+ <code class="computeroutput">[first,last)</code>.
+ </li>
<li class="listitem">
-Returns: <code class="computeroutput">last</code>.
- </li>
+ Returns: <code class="computeroutput">last</code>.
+ </li>
<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>
+ <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 class="listitem">
-Exception safety: nothrow.
- </li>
+ 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);
+<a name="reference_unordered_set_of_replace_iterator_value"></a><pre class="programlisting">bool replace(iterator position, const value_type & x);
</pre>
<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>
+ Requires: <code class="computeroutput">position</code>
+ is a valid dereferenceable <code class="computeroutput">iterator</code>
+ of the view.
+ </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 class="itemizedlist" type="circle">
+ 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 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>
+ the view is non-unique OR no other element with equivalent
+ key exists (except possibly <code class="computeroutput">*position</code>),
+ </li>
<li class="listitem">
- AND replacing is allowed by all other views of the <code class="computeroutput">bimap</code>.
- </li>
+ 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>
+ Postconditions: Validity of position
+ is preserved in all cases.
+ </li>
<li class="listitem">
-Returns: <code class="computeroutput">true</code>
- if the replacement took place, <code class="computeroutput">false</code>
- otherwise.
- </li>
+ Returns: <code class="computeroutput">true</code>
+ if the replacement took place, <code class="computeroutput">false</code>
+ otherwise.
+ </li>
<li class="listitem">
-<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
- O(R(n)).
- </li>
+ <a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
+ O(R(n)).
+ </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.
- </li>
+ 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.
+ </li>
</ul></div>
-<a name="reference_unordered_set_of_replace_key_iterator_key"></a>
- 
-<pre class="programlisting">template< class CompatibleKey >
+<a name="reference_unordered_set_of_replace_key_iterator_key"></a><pre class="programlisting">template< class CompatibleKey >
bool replace_key(iterator position, const CompatibleKey & x);
</pre>
<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 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 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 class="listitem">
- AND replacing is allowed by all other views of the <code class="computeroutput">bimap</code>.
- </li>
-</ul></div>
-</li>
-<li class="listitem">
-Postconditions: Validity of position
- is preserved in all cases.
- </li>
-<li class="listitem">
-Returns: <code class="computeroutput">true</code>
- if the replacement took place, <code class="computeroutput">false</code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
- O(R(n)).
- </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.
- </li>
+ 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 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 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 class="listitem">
+ AND replacing is allowed by all other views of the <code class="computeroutput">bimap</code>.
+ </li>
+</ul></div>
+ </li>
+<li class="listitem">
+ Postconditions: Validity of position
+ is preserved in all cases.
+ </li>
+<li class="listitem">
+ Returns: <code class="computeroutput">true</code>
+ if the replacement took place, <code class="computeroutput">false</code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
+ O(R(n)).
+ </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.
+ </li>
</ul></div>
-<a name="reference_unordered_set_of_replace_data_iterator_data"></a>
- 
-<pre class="programlisting">template< class CompatibleData >
+<a name="reference_unordered_set_of_replace_data_iterator_data"></a><pre class="programlisting">template< class CompatibleData >
bool replace_data(iterator position, const CompatibleData & x);
</pre>
<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 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 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 class="listitem">
- AND replacing is allowed by all other views of the <code class="computeroutput">bimap</code>.
- </li>
-</ul></div>
-</li>
-<li class="listitem">
-Postconditions: Validity of position
- is preserved in all cases.
- </li>
-<li class="listitem">
-Returns: <code class="computeroutput">true</code>
- if the replacement took place, <code class="computeroutput">false</code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
- O(R(n)).
- </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.
- </li>
+ 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 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 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 class="listitem">
+ AND replacing is allowed by all other views of the <code class="computeroutput">bimap</code>.
+ </li>
+</ul></div>
+ </li>
+<li class="listitem">
+ Postconditions: Validity of position
+ is preserved in all cases.
+ </li>
+<li class="listitem">
+ Returns: <code class="computeroutput">true</code>
+ if the replacement took place, <code class="computeroutput">false</code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
+ O(R(n)).
+ </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.
+ </li>
</ul></div>
-<a name="reference_unordered_set_of_modify_key_iterator_modifier"></a>
- 
-<pre class="programlisting">template< class KeyModifier >
+<a name="reference_unordered_set_of_modify_key_iterator_modifier"></a><pre class="programlisting">template< class KeyModifier >
bool modify_key(iterator position, KeyModifier mod);
</pre>
<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 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 class="itemizedlist" type="circle">
-<li class="listitem">
- the map view is non-unique OR no other element with equivalent
- key exists,
- </li>
-<li class="listitem">
- AND rearrangement is allowed by all other views of the <code class="computeroutput">bimap</code>.
- </li>
-</ul></div>
-</li>
-<li class="listitem">
-Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
- succeeds.
- </li>
-<li class="listitem">
-Returns: <code class="computeroutput">true</code>
- if the operation succeeded, <code class="computeroutput">false</code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
- O(M(n)).
- </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>
+ 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 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 class="itemizedlist" type="circle">
+<li class="listitem">
+ the map view is non-unique OR no other element with equivalent
+ key exists,
+ </li>
+<li class="listitem">
+ AND rearrangement is allowed by all other views of the <code class="computeroutput">bimap</code>.
+ </li>
+</ul></div>
+ </li>
+<li class="listitem">
+ Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
+ succeeds.
+ </li>
+<li class="listitem">
+ Returns: <code class="computeroutput">true</code>
+ if the operation succeeded, <code class="computeroutput">false</code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
+ O(M(n)).
+ </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 class="listitem">
-Note: Only provided for map views.
- </li>
+ 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 >
+<a name="reference_unordered_set_of_modify_data_iterator_modifier"></a><pre class="programlisting">template< class DataModifier >
bool modify_data(iterator position, DataModifier mod);
</pre>
<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 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 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 class="listitem">
- AND rearrangement is allowed by all other views of the <code class="computeroutput">bimap</code>.
- </li>
-</ul></div>
-</li>
-<li class="listitem">
-Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
- succeeds.
- </li>
-<li class="listitem">
-Returns: <code class="computeroutput">true</code>
- if the operation succeeded, <code class="computeroutput">false</code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
- O(M(n)).
- </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>
+ 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 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 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 class="listitem">
+ AND rearrangement is allowed by all other views of the <code class="computeroutput">bimap</code>.
+ </li>
+</ul></div>
+ </li>
+<li class="listitem">
+ Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
+ succeeds.
+ </li>
+<li class="listitem">
+ Returns: <code class="computeroutput">true</code>
+ if the operation succeeded, <code class="computeroutput">false</code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature">Complexity:</a>
+ O(M(n)).
+ </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 class="listitem">
-Note: Only provided for map views.
- </li>
+ Note: Only provided for map views.
+ </li>
</ul></div>
</div>
-<div class="section" title="Lookup">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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>
@@ -950,9 +929,7 @@
 <code class="computeroutput">operator()</code>
 member functions.
 
-<a name="reference_unordered_set_of_find_key"></a>
- 
-<pre class="programlisting">template< class CompatibleKey >
+<a name="reference_unordered_set_of_find_key"></a><pre class="programlisting">template< class CompatibleKey >
iterator find(const CompatibleKey & x);

template< class CompatibleKey >
@@ -960,34 +937,30 @@
</pre>
<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 class="listitem">
-Complexity: Average case O(1) (constant),
- worst case O(n).
- </li>
+ 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 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 >
+<a name="reference_unordered_set_of_count_key"></a><pre class="programlisting">template< class CompatibleKey >
size_type count(const CompatibleKey & x) const;
</pre>
<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 class="listitem">
-Complexity: Average case O(count(x)),
- worst case O(n).
- </li>
+ Effects: Returns the number of elements
+ with key equivalent to <code class="computeroutput">x</code>.
+ </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 >
+<a name="reference_unordered_set_of_equal_range_key"></a><pre class="programlisting">template< class CompatibleKey >
std::pair<iterator,iterator>
 equal_range(const CompatibleKey & x);

@@ -997,44 +970,42 @@
</pre>
<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>
+ Effects: Returns a range containing
+ all elements with keys equivalent to <code class="computeroutput">x</code>
+ (and only those).
+ </li>
<li class="listitem">
-Complexity: Average case O(count(x)),
- worst case O(n).
- </li>
+ Complexity: Average case O(count(x)),
+ worst case O(n).
+ </li>
</ul></div>
</div>
-<div class="section" title="at(), info_at() and operator[] - set_of only">
+<div class="section">
<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 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 >
+<a name="reference_unordered_set_of_at_key_const"></a><pre class="programlisting">template< class CompatibleKey >
const data_type & at(const CompatibleKey & k) const;
</pre>
<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 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 class="listitem">
-Complexity: Average case O(1) (constant),
- worst case O(n).
- </li>
+ Requires: <code class="computeroutput">CompatibleKey</code>
+ is a compatible key of <code class="computeroutput">key_compare</code>.
+ </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 class="listitem">
+ Complexity: Average case O(1) (constant),
+ worst case O(n).
+ </li>
<li class="listitem">
-Note: Only provided when <code class="computeroutput">unordered_set_of</code> is used.
- </li>
+ Note: Only provided when <code class="computeroutput">unordered_set_of</code> is used.
+ </li>
</ul></div>

 The symmetry of bimap imposes some constraints on <code class="computeroutput">operator[]</code> and the non constant version of at()
@@ -1042,57 +1013,52 @@
 Tey are only provided if the other collection type is mutable (<code class="computeroutput">list_of</code>, <code class="computeroutput">vector_of</code>
 and <code class="computeroutput">unconstrained_set_of</code>).
 
-<a name="reference_unordered_set_of_operator_bracket_key"></a>
- 
-<pre class="programlisting">template< class CompatibleKey >
+<a name="reference_unordered_set_of_operator_bracket_key"></a><pre class="programlisting">template< class CompatibleKey >
data_type & operator[](const CompatibleKey & k);
</pre>
<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 class="listitem">
-Effects: <code class="computeroutput">return
- insert(value_type(k,data_type()))->second;</code>
-</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 class="listitem">
-Note: Only provided when <code class="computeroutput">unordered_set_of</code> is used and the
- other collection type is mutable.
- </li>
+ Requires: <code class="computeroutput">CompatibleKey</code>
+ is a compatible key of <code class="computeroutput">key_compare</code>.
+ </li>
+<li class="listitem">
+ Effects: <code class="computeroutput">return
+ insert(value_type(k,data_type()))->second;</code>
+ </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 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 >
+<a name="reference_unordered_set_of_at_key"></a><pre class="programlisting">template< class CompatibleKey >
data_type & at(const CompatibleKey & k);
</pre>
<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 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 class="listitem">
-Complexity: Average case O(1) (constant),
- worst case O(n).
- </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>
+ Requires: <code class="computeroutput">CompatibleKey</code>
+ is a compatible key of <code class="computeroutput">key_compare</code>.
+ </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 class="listitem">
+ Complexity: Average case O(1) (constant),
+ worst case O(n).
+ </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 >
+<a name="reference_unordered_set_of_info_at_key"></a><pre class="programlisting">template< class CompatibleKey >
info_type & info_at(const CompatibleKey & k);

template< class CompatibleKey >
@@ -1100,53 +1066,51 @@
</pre>
<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>
+ Requires: <code class="computeroutput">CompatibleKey</code>
+ is a compatible key of <code class="computeroutput">key_compare</code>.
+ </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>
+ 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 class="listitem">
-Complexity: Average case O(1) (constant),
- worst case O(n).
- </li>
+ Complexity: Average case O(1) (constant),
+ worst case O(n).
+ </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>
+ 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" title="Hash policy">
+<div class="section">
<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 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);
+<a name="reference_unordered_set_of_rehash_size"></a><pre class="programlisting">void rehash(size_type n);
</pre>
<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>
+ 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 class="listitem">
-Postconditions: Validity of iterators
- and references to the elements contained is preserved.
- </li>
+ Postconditions: Validity of iterators
+ and references to the elements contained is preserved.
+ </li>
<li class="listitem">
-Complexity: Average case O(size()),
- worst case O(size(n)2).
- </li>
+ Complexity: Average case O(size()),
+ worst case O(size(n)2).
+ </li>
<li class="listitem">
-Exception safety: Strong.
- </li>
+ Exception safety: Strong.
+ </li>
</ul></div>
</div>
-<div class="section" title="Serialization">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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>
@@ -1164,9 +1128,9 @@
 
</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>
+ Requires: No additional requirements
+ to those imposed by the container.
+ </li></ul></div>
<div class="sidebar">


@@ -1176,18 +1140,18 @@
</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 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>
+ 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 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">

@@ -1198,11 +1162,11 @@
 
</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>
+ 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">


@@ -1213,17 +1177,17 @@
</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 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>
+ 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 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">

@@ -1233,9 +1197,9 @@
 
</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>
+ 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">


@@ -1246,31 +1210,31 @@
</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>; if <code class="computeroutput">it</code>
- was <code class="computeroutput">m.get<i>().end(n)</code>
- for some n, then <code class="computeroutput">it</code>'<code class="computeroutput">
- == m</code>'<code class="computeroutput">.get<i>().end(n)</code> (where <code class="computeroutput">b</code>
- is the original <code class="computeroutput">bimap</code>,
- <code class="computeroutput">b</code>' its restored copy
- and <code class="computeroutput">i</code> is the ordinal
- of the index.)
- </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
- viceversa.
- </li>
+ 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>; if <code class="computeroutput">it</code>
+ was <code class="computeroutput">m.get<i>().end(n)</code>
+ for some n, then <code class="computeroutput">it</code>'<code class="computeroutput">
+ == m</code>'<code class="computeroutput">.get<i>().end(n)</code> (where <code class="computeroutput">b</code>
+ is the original <code class="computeroutput">bimap</code>,
+ <code class="computeroutput">b</code>' its restored copy
+ and <code class="computeroutput">i</code> is the ordinal
+ of the index.)
+ </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 viceversa.
+ </li>
</ul></div>
</div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -1278,7 +1242,7 @@
</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>
+<a accesskey="p" href="set_of_reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="list_of_reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>vector_of Reference</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<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">
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="list_of_reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unconstrained_set_of_reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="vector_of Reference">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<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>
@@ -49,7 +49,7 @@
<dt>Serialization</dt>
</dl></dd>
</dl></div>
-<div class="section" title='Header "boost/bimap/vector_of.hpp" synopsis'>
+<div class="section">
<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 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>
@@ -68,7 +68,7 @@
} // namespace boost
</pre>
</div>
-<div class="section" title="vector_of views">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<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>
@@ -109,18 +109,18 @@
 
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- vector_of views are not Assignable
- (like any other view.)
- </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 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>
+ vector_of views are not Assignable
+ (like any other view.)
+ </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 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>
</ul></div>

 Having these restrictions into account, vector of views are models of
@@ -321,9 +321,7 @@

typedef signature-compatible with std::pair< ... , Left > value_type;
</pre>
-<a name="vector_of_complexity_signature"></a>
- 
-<div class="section" title="Complexity signature">
+<a name="vector_of_complexity_signature"></a><div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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>
@@ -336,26 +334,28 @@
 
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- copying: <code class="computeroutput">c(n) = n * log(n)</code>,
- </li>
-<li class="listitem">
- insertion: <code class="computeroutput">i(n) = 1</code> (amortized
- constant),
- </li>
-<li class="listitem">
- hinted insertion: <code class="computeroutput">h(n) = 1</code> (amortized constant),
- </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 class="listitem">
- replacement: <code class="computeroutput">r(n) = 1</code> (constant),
- </li>
+ copying: <code class="computeroutput">c(n) = n * log(n)</code>,
+ </li>
<li class="listitem">
- modifying: <code class="computeroutput">m(n) = 1</code> (constant).
- </li>
+ insertion: <code class="computeroutput">i(n) = 1</code>
+ (amortized constant),
+ </li>
+<li class="listitem">
+ hinted insertion: <code class="computeroutput">h(n) = 1</code> (amortized constant),
+ </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 class="listitem">
+ replacement: <code class="computeroutput">r(n) = 1</code>
+ (constant),
+ </li>
+<li class="listitem">
+ modifying: <code class="computeroutput">m(n) = 1</code>
+ (constant).
+ </li>
</ul></div>

 The following expressions are also used as a convenience for writing
@@ -375,7 +375,7 @@
 and relocate, respectively.)
 
</div>
-<div class="section" title="Instantiation types">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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>
@@ -388,14 +388,14 @@
 
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<code class="computeroutput">Value</code> from <code class="computeroutput">vector_of</code>,
- </li>
+ <code class="computeroutput">Value</code> from <code class="computeroutput">vector_of</code>,
+ </li>
<li class="listitem">
-<code class="computeroutput">Allocator</code> from <code class="computeroutput">bimap</code>,
- </li>
+ <code class="computeroutput">Allocator</code> from <code class="computeroutput">bimap</code>,
+ </li>
</ul></div>
</div>
-<div class="section" title="Constructors, copy and assignment">
+<div class="section">
<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 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>
@@ -408,492 +408,455 @@
</pre>
<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>
+ 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 class="listitem">
-Returns: <code class="computeroutput">*this</code>.
- </li>
+ Returns: <code class="computeroutput">*this</code>.
+ </li>
</ul></div>
-<a name="reference_vector_of_assign_iterator_iterator"></a>
- 
-<pre class="programlisting">template< class InputIterator >
+<a name="reference_vector_of_assign_iterator_iterator"></a><pre class="programlisting">template< class InputIterator >
void assign(InputIterator first, InputIterator last);
</pre>
<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>
- or a type convertible to <code class="computeroutput">value_type</code>.
- <code class="computeroutput">first</code> and <code class="computeroutput">last</code> are not iterators into any view
- of the <code class="computeroutput">bimap</code> to which
- this view belongs. <code class="computeroutput">last</code>
- is reachable from <code class="computeroutput">first</code>.
- </li>
+ 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>
+ or a type convertible to <code class="computeroutput">value_type</code>.
+ <code class="computeroutput">first</code> and <code class="computeroutput">last</code> are not iterators into any
+ view of the <code class="computeroutput">bimap</code>
+ to which this view belongs. <code class="computeroutput">last</code>
+ is reachable from <code class="computeroutput">first</code>.
+ </li>
<li class="listitem">
-Effects: <code class="computeroutput">clear(); insert(end(),first,last);</code>
-</li>
+ 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);
+<a name="reference_vector_of_assign_size_value"></a><pre class="programlisting">void assign(size_type n, const value_type & value);
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
-Effects: <code class="computeroutput">clear(); for(size_type
- i =
- 0;
- i <
- n;
- ++n) push_back(v);</code>
-</li></ul></div>
+ Effects: <code class="computeroutput">clear(); for(size_type
+ i =
+ 0;
+ i <
+ n;
+ ++n) push_back(v);</code>
+ </li></ul></div>
</div>
-<div class="section" title="Capacity operations">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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;
+<a name="reference_vector_of_capacity"></a><pre class="programlisting">size_type capacity() const;
</pre>
<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()
- < c</code>,
- back insertions happen in constant time (the general case as described
- by i(n) is amortized constant time.)
- </li>
+ Returns: The total number of elements
+ <code class="computeroutput">c</code> such that, when
+ <code class="computeroutput">size()
+ < c</code>,
+ back insertions happen in constant time (the general case as described
+ by i(n) is amortized constant time.)
+ </li>
<li class="listitem">
-Note: Validity of iterators and references
- to elements is preserved in all insertions, regardless of the capacity
- status.
- </li>
+ Note: Validity of iterators and
+ references to elements is preserved in all insertions, regardless
+ of the capacity status.
+ </li>
</ul></div>
-<a name="reference_vector_of_reserve_size"></a>
- 
-<pre class="programlisting">void reserve(size_type m);
+<a name="reference_vector_of_reserve_size"></a><pre class="programlisting">void reserve(size_type m);
</pre>
<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>
+ 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 class="listitem">
-Complexity: If the capacity is not
- changed, constant; otherwise O(n).
- </li>
+ Complexity: If the capacity is not
+ changed, constant; otherwise O(n).
+ </li>
<li class="listitem">
-Exception safety: If the capacity
- is not changed, nothrow; otherwise, strong.
- </li>
+ 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());
+<a name="reference_vector_of_resize_size_value"></a><pre class="programlisting">void resize(size_type n, const value_type & x = value_type());
</pre>
<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>
+ 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 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>
+ 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" title="Modifiers">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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);
+<a name="reference_vector_of_push_front_value"></a><pre class="programlisting">std::pair<iterator,bool> push_front(const value_type & x);
</pre>
<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>
+ 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 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
- insertion took place. On successful insertion, <code class="computeroutput">p.first</code>
- points to the element inserted; otherwise, <code class="computeroutput">p.first</code>
- points to an element that caused the insertion to be banned. Note that
- more than one element can be causing insertion not to be allowed.
- </li>
+ 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 insertion took place. On successful insertion, <code class="computeroutput">p.first</code> points to the element inserted;
+ otherwise, <code class="computeroutput">p.first</code> points to an element that
+ caused the insertion to be banned. Note that more than one element
+ can be causing insertion not to be allowed.
+ </li>
<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
- O(n+I(n)).
- </li>
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
+ O(n+I(n)).
+ </li>
<li class="listitem">
-Exception safety: Strong.
- </li>
+ 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);
+<a name="reference_vector_of_push_back_value"></a><pre class="programlisting">std::pair<iterator,bool> push_back(const value_type & x);
</pre>
<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>
+ 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 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
- insertion took place. On successful insertion, <code class="computeroutput">p.first</code>
- points to the element inserted; otherwise, <code class="computeroutput">p.first</code>
- points to an element that caused the insertion to be banned. Note that
- more than one element can be causing insertion not to be allowed.
- </li>
+ 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 insertion took place. On successful insertion, <code class="computeroutput">p.first</code> points to the element inserted;
+ otherwise, <code class="computeroutput">p.first</code> points to an element that
+ caused the insertion to be banned. Note that more than one element
+ can be causing insertion not to be allowed.
+ </li>
<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
- O(I(n)).
- </li>
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
+ O(I(n)).
+ </li>
<li class="listitem">
-Exception safety: Strong.
- </li>
+ 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);
+<a name="reference_vector_of_insert_iterator_value"></a><pre class="programlisting">std::pair<iterator,bool> insert(iterator position, const value_type & x);
</pre>
<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>
+ Requires: <code class="computeroutput">position</code>
+ is a valid iterator of the view.
+ </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>
+ 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 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
- insertion took place. On successful insertion, <code class="computeroutput">p.first</code>
- points to the element inserted; otherwise, <code class="computeroutput">p.first</code>
- points to an element that caused the insertion to be banned. Note that
- more than one element can be causing insertion not to be allowed.
- </li>
+ 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 insertion took place. On successful insertion, <code class="computeroutput">p.first</code> points to the element inserted;
+ otherwise, <code class="computeroutput">p.first</code> points to an element that
+ caused the insertion to be banned. Note that more than one element
+ can be causing insertion not to be allowed.
+ </li>
<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>
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
+ O(shl(end()-position,1) + I(n)).
+ </li>
<li class="listitem">
-Exception safety: Strong.
- </li>
+ 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);
+<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>
<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>
+ Requires: <code class="computeroutput">position</code>
+ is a valid iterator of the view.
+ </li>
<li class="listitem">
-Effects: <code class="computeroutput">for(size_type
- i =
- 0;
- i <
- m;
- ++i) insert(position, x);</code>
-</li>
+ Effects: <code class="computeroutput">for(size_type
+ i =
+ 0;
+ i <
+ m;
+ ++i) insert(position, x);</code>
+ </li>
<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>
+ <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 >
+<a name="reference_vector_of_insert_iterator_iterator_iterator"></a><pre class="programlisting">template< class InputIterator >
void insert(iterator position, InputIterator first, InputIterator last);
</pre>
<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
- Iterator</a> over elements of type <code class="computeroutput">value_type</code>
- or a type convertible to <code class="computeroutput">value_type</code>.
- <code class="computeroutput">first</code> and <code class="computeroutput">last</code> are not iterators into any view
- of the <code class="computeroutput">bimap</code> to which
- this view belongs. <code class="computeroutput">last</code>
- is reachable from <code class="computeroutput">first</code>.
- </li>
+ 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
+ Iterator</a> over elements of type <code class="computeroutput">value_type</code>
+ or a type convertible to <code class="computeroutput">value_type</code>.
+ <code class="computeroutput">first</code> and <code class="computeroutput">last</code> are not iterators into any
+ view of the <code class="computeroutput">bimap</code>
+ to which this view belongs. <code class="computeroutput">last</code>
+ is reachable from <code class="computeroutput">first</code>.
+ </li>
<li class="listitem">
-Effects: <code class="computeroutput">while(first!=last)insert(position,*first++);</code>
-</li>
+ Effects: <code class="computeroutput">while(first!=last)insert(position,*first++);</code>
+ </li>
<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>
+ <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 class="listitem">
-Exception safety: Basic.
- </li>
+ Exception safety: Basic.
+ </li>
</ul></div>
-<a name="reference_vector_of_erase_iterator"></a>
- 
-<pre class="programlisting">iterator erase(iterator position);
+<a name="reference_vector_of_erase_iterator"></a><pre class="programlisting">iterator erase(iterator position);
</pre>
<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>
+ Requires: <code class="computeroutput">position</code>
+ is a valid dereferenceable iterator of the view.
+ </li>
<li class="listitem">
-Effects: Deletes the element pointed
- to by <code class="computeroutput">position</code>.
- </li>
+ Effects: Deletes the element pointed
+ to by <code class="computeroutput">position</code>.
+ </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>
+ 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 class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
- O(D(n)).
- </li>
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
+ O(D(n)).
+ </li>
<li class="listitem">
-Exception safety: nothrow.
- </li>
+ Exception safety: nothrow.
+ </li>
</ul></div>
-<a name="reference_vector_of_erase_iterator_iterator"></a>
- 
-<pre class="programlisting">iterator erase(iterator first, iterator last);
+<a name="reference_vector_of_erase_iterator_iterator"></a><pre class="programlisting">iterator erase(iterator first, iterator last);
</pre>
<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>
+ Requires: <code class="computeroutput">[first,last)</code>
+ is a valid range of the view.
+ </li>
<li class="listitem">
-Effects: Deletes the elements in
- <code class="computeroutput">[first,last)</code>.
- </li>
+ Effects: Deletes the elements in
+ <code class="computeroutput">[first,last)</code>.
+ </li>
<li class="listitem">
-Returns: last.
- </li>
+ Returns: last.
+ </li>
<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>
+ <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 class="listitem">
-Exception safety: nothrow.
- </li>
+ 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);
+<a name="reference_vector_of_replace_iterator_value"></a><pre class="programlisting">bool replace(iterator position, const value_type & x);
</pre>
<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>
+ Requires: <code class="computeroutput">position</code>
+ is a valid dereferenceable iterator of the view.
+ </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>
+ 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 class="listitem">
-Postconditions: Validity of position
- is preserved in all cases.
- </li>
+ Postconditions: Validity of position
+ is preserved in all cases.
+ </li>
<li class="listitem">
-Returns: <code class="computeroutput">true</code>
- if the replacement took place, <code class="computeroutput">false</code>
- otherwise.
- </li>
+ Returns: <code class="computeroutput">true</code>
+ if the replacement took place, <code class="computeroutput">false</code>
+ otherwise.
+ </li>
<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
- O(R(n)).
- </li>
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
+ O(R(n)).
+ </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.
- </li>
+ 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.
+ </li>
</ul></div>
-<a name="reference_vector_of_replace_key_iterator_key"></a>
- 
-<pre class="programlisting">template< class CompatibleKey >
+<a name="reference_vector_of_replace_key_iterator_key"></a><pre class="programlisting">template< class CompatibleKey >
bool replace_key(iterator position, const CompatibleKey & x);
</pre>
<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 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 replacing is allowed by all other views of
- the <code class="computeroutput">bimap</code>.
- </li>
-<li class="listitem">
-Postconditions: Validity of position
- is preserved in all cases.
- </li>
-<li class="listitem">
-Returns: <code class="computeroutput">true</code>
- if the replacement took place, <code class="computeroutput">false</code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
- O(R(n)).
- </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.
- </li>
+ 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 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 replacing is allowed by all other views
+ of the <code class="computeroutput">bimap</code>.
+ </li>
+<li class="listitem">
+ Postconditions: Validity of position
+ is preserved in all cases.
+ </li>
+<li class="listitem">
+ Returns: <code class="computeroutput">true</code>
+ if the replacement took place, <code class="computeroutput">false</code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
+ O(R(n)).
+ </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.
+ </li>
</ul></div>
-<a name="reference_vector_of_replace_data_iterator_data"></a>
- 
-<pre class="programlisting">template< class CompatibleData >
+<a name="reference_vector_of_replace_data_iterator_data"></a><pre class="programlisting">template< class CompatibleData >
bool replace_data(iterator position, const CompatibleData & x);
</pre>
<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 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 replacing is allowed by all other views of
- the <code class="computeroutput">bimap</code>.
- </li>
-<li class="listitem">
-Postconditions: Validity of position
- is preserved in all cases.
- </li>
-<li class="listitem">
-Returns: <code class="computeroutput">true</code>
- if the replacement took place, <code class="computeroutput">false</code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
- O(R(n)).
- </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.
- </li>
+ 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 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 replacing is allowed by all other views
+ of the <code class="computeroutput">bimap</code>.
+ </li>
+<li class="listitem">
+ Postconditions: Validity of position
+ is preserved in all cases.
+ </li>
+<li class="listitem">
+ Returns: <code class="computeroutput">true</code>
+ if the replacement took place, <code class="computeroutput">false</code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
+ O(R(n)).
+ </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.
+ </li>
</ul></div>
-<a name="reference_vector_of_modify_key_iterator_modifier"></a>
- 
-<pre class="programlisting">template< class KeyModifier >
+<a name="reference_vector_of_modify_key_iterator_modifier"></a><pre class="programlisting">template< class KeyModifier >
bool modify_key(iterator position, KeyModifier mod);
</pre>
<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 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 class="listitem">
-Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
- succeeds.
- </li>
-<li class="listitem">
-Returns: <code class="computeroutput">true</code>
- if the operation succeeded, <code class="computeroutput">false</code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
- O(M(n)).
- </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>
+ 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 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 class="listitem">
+ Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
+ succeeds.
+ </li>
+<li class="listitem">
+ Returns: <code class="computeroutput">true</code>
+ if the operation succeeded, <code class="computeroutput">false</code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
+ O(M(n)).
+ </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 class="listitem">
-Note: Only provided for map views.
- </li>
+ 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 >
+<a name="reference_vector_of_modify_data_iterator_modifier"></a><pre class="programlisting">template< class DataModifier >
bool modify_data(iterator position, DataModifier mod);
</pre>
<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 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 class="listitem">
-Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
- succeeds.
- </li>
-<li class="listitem">
-Returns: <code class="computeroutput">true</code>
- if the operation succeeded, <code class="computeroutput">false</code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
- O(M(n)).
- </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>
+ 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 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 class="listitem">
+ Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
+ succeeds.
+ </li>
+<li class="listitem">
+ Returns: <code class="computeroutput">true</code>
+ if the operation succeeded, <code class="computeroutput">false</code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature">Complexity:</a>
+ O(M(n)).
+ </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 class="listitem">
-Note: Only provided for map views.
- </li>
+ Note: Only provided for map views.
+ </li>
</ul></div>
</div>
-<div class="section" title="List operations">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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>
@@ -905,315 +868,297 @@
 operations exactly matches those of <code class="computeroutput">list_of</code>
 views, but the associated complexity bounds differ in general.
 
-<a name="reference_vector_of_splice_iterator_this"></a>
- 
-<pre class="programlisting">void splice(iterator position, this_type & x);
+<a name="reference_vector_of_splice_iterator_this"></a><pre class="programlisting">void splice(iterator position, this_type & x);
</pre>
<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>
+ Requires: <code class="computeroutput">position</code>
+ is a valid iterator of the view. <code class="computeroutput">&x!=this</code>.
+ </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>
+ 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 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>
+ <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 class="listitem">
-Exception safety: Basic.
- </li>
+ 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);
+<a name="reference_vector_of_splice_iterator_this_iterator"></a><pre class="programlisting">void splice(iterator position, this_type & x,iterator i);
</pre>
<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>
+ 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 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>.
- 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>
+ 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>.
+ 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 class="listitem">
-Postconditions: If <code class="computeroutput">&x==this</code>, no iterator or reference is invalidated.
- </li>
+ Postconditions: If <code class="computeroutput">&x==this</code>,
+ no iterator or reference is invalidated.
+ </li>
<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>
+ <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 class="listitem">
-Exception safety: If <code class="computeroutput">&x==this</code>,
- nothrow; otherwise, strong.
- </li>
+ 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);
+<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>
<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>
+ 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 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>
+ 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 class="listitem">
-Postconditions: If <code class="computeroutput">&x==this</code>, no iterator or reference is invalidated.
- </li>
+ Postconditions: If <code class="computeroutput">&x==this</code>,
+ no iterator or reference is invalidated.
+ </li>
<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>
+ <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 class="listitem">
-Exception safety: If <code class="computeroutput">&x==this</code>,
- nothrow; otherwise, basic.
- </li>
+ 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);
+<a name="reference_vector_of_remove_value"></a><pre class="programlisting">void remove(const value_type & value);
</pre>
<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>
+ Effects: Erases all elements of
+ the view which compare equal to <code class="computeroutput">value</code>.
+ </li>
<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>
+ <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 class="listitem">
-Exception safety: Basic.
- </li>
+ Exception safety: Basic.
+ </li>
</ul></div>
-<a name="reference_vector_of_remove_if_predicate"></a>
- 
-<pre class="programlisting">template< class Predicate >
+<a name="reference_vector_of_remove_if_predicate"></a><pre class="programlisting">template< class Predicate >
void remove_if(Predicate pred);
</pre>
<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>
+ Effects: Erases all elements <code class="computeroutput">x</code> of the view for which <code class="computeroutput">pred(x)</code>
+ holds.
+ </li>
<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>
+ <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 class="listitem">
-Exception safety: Basic.
- </li>
+ Exception safety: Basic.
+ </li>
</ul></div>
-<a name="reference_vector_of_unique"></a>
- 
-<pre class="programlisting">void unique();
+<a name="reference_vector_of_unique"></a><pre class="programlisting">void unique();
</pre>
<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>
+ 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 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>
+ <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 class="listitem">
-Exception safety: Basic.
- </li>
+ Exception safety: Basic.
+ </li>
</ul></div>
-<a name="reference_vector_of_unique_predicate"></a>
- 
-<pre class="programlisting">template< class BinaryPredicate >
+<a name="reference_vector_of_unique_predicate"></a><pre class="programlisting">template< class BinaryPredicate >
void unique(BinaryPredicate binary_pred);
</pre>
<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 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 class="listitem">
-Exception safety: Basic.
- </li>
-</ul></div>
-<a name="reference_vector_of_merge_this"></a>
- 
-<pre class="programlisting">void merge(this_type & x);
+ 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 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 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>
<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 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 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 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 class="listitem">
-Exception safety: If <code class="computeroutput">&x==this</code>,
- nothrow; otherwise, basic.
- </li>
+ 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 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 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 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 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 >
+<a name="reference_vector_of_merge_this_compare"></a><pre class="programlisting">template< class Compare >
void merge(this_type & x, Compare comp);
</pre>
<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 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>).
- 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 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 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 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();
+ 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 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>). 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 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 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 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>
<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>
+ 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 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 class="listitem">
+ Postconditions: Validity of iterators
+ and references is preserved.
+ </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>
+ Complexity: O(n*log(n)).
+ </li>
<li class="listitem">
-Postconditions: Validity of iterators
- and references is preserved.
- </li>
-<li class="listitem">
-Complexity: O(n*log(n)).
- </li>
-<li class="listitem">
-Exception safety: Basic.
- </li>
+ Exception safety: Basic.
+ </li>
</ul></div>
-<a name="reference_vector_of_sort_compare"></a>
- 
-<pre class="programlisting">template< class Compare >
+<a name="reference_vector_of_sort_compare"></a><pre class="programlisting">template< class Compare >
void sort(Compare comp);
</pre>
<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>
+ 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 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>
+ 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 class="listitem">
-Postconditions: Validity of iterators
- and references is preserved.
- </li>
+ Postconditions: Validity of iterators
+ and references is preserved.
+ </li>
<li class="listitem">
-Complexity: O(n*log(n)).
- </li>
+ Complexity: O(n*log(n)).
+ </li>
<li class="listitem">
-Exception safety: Basic.
- </li>
+ Exception safety: Basic.
+ </li>
</ul></div>
-<a name="reference_vector_of_reverse"></a>
- 
-<pre class="programlisting">void reverse();
+<a name="reference_vector_of_reverse"></a><pre class="programlisting">void reverse();
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-Effects: Reverses the order of the
- elements in the view.
- </li>
+ Effects: Reverses the order of the
+ elements in the view.
+ </li>
<li class="listitem">
-Postconditions: Validity of iterators
- and references is preserved.
- </li>
+ Postconditions: Validity of iterators
+ and references is preserved.
+ </li>
<li class="listitem">
-Complexity: O(n).
- </li>
+ Complexity: O(n).
+ </li>
<li class="listitem">
-Exception safety: nothrow.
- </li>
+ Exception safety: nothrow.
+ </li>
</ul></div>
</div>
-<div class="section" title="Rearrange operations">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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>
@@ -1223,62 +1168,59 @@
 (although splice provides partially overlapping functionality), perform
 individual and global repositioning of elements inside the index.
 
-<a name="reference_vector_of_relocate_iterator_iterator"></a>
- 
-<pre class="programlisting">void relocate(iterator position, iterator i);
+<a name="reference_vector_of_relocate_iterator_iterator"></a><pre class="programlisting">void relocate(iterator position, iterator i);
</pre>
<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>
+ 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 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>
+ 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 class="listitem">
-Postconditions: No iterator or reference
- is invalidated.
- </li>
+ Postconditions: No iterator or reference
+ is invalidated.
+ </li>
<li class="listitem">
-Complexity: Constant.
- </li>
+ Complexity: Constant.
+ </li>
<li class="listitem">
-Exception safety: nothrow.
- </li>
+ 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);
+<a name="reference_vector_of_relocate_iterator_iterator_iterator"></a><pre class="programlisting">void relocate(iterator position, iterator first, iterator last);
</pre>
<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 the view. <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>
+ 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 the view. <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 class="listitem">
-Effects: The range of elements <code class="computeroutput">[first,last)</code> is repositioned just before <code class="computeroutput">position</code>.
- </li>
+ Effects: The range of elements
+ <code class="computeroutput">[first,last)</code> is repositioned just before <code class="computeroutput">position</code>.
+ </li>
<li class="listitem">
-Postconditions: No iterator or reference
- is invalidated.
- </li>
+ Postconditions: No iterator or reference
+ is invalidated.
+ </li>
<li class="listitem">
-Complexity: Constant.
- </li>
+ Complexity: Constant.
+ </li>
<li class="listitem">
-Exception safety: nothrow.
- </li>
+ Exception safety: nothrow.
+ </li>
</ul></div>
</div>
-<div class="section" title="Serialization">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<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>
@@ -1298,9 +1240,9 @@
 
</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>
+ Requires: No additional requirements
+ to those imposed by the container.
+ </li></ul></div>
<div class="sidebar">


@@ -1310,19 +1252,17 @@
</div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-Requires: No additional requirements
- to those imposed by the container.
- </li>
-<li class="listitem">
-Postconditions: On successful loading,
- each of the elements of <code class="computeroutput">[begin(),
- end())</code>
- is a restored copy of the corresponding element in <code class="computeroutput">[m.get<i>().begin(),
- m.get<i>().end())</code>,
- where <code class="computeroutput">i</code> is the position
- of the <code class="computeroutput">vector_of</code> view
- in the container.
- </li>
+ Requires: No additional requirements
+ to those imposed by the container.
+ </li>
+<li class="listitem">
+ Postconditions: On successful loading,
+ each of the elements of <code class="computeroutput">[begin(),
+ end())</code>
+ is a restored copy of the corresponding element in <code class="computeroutput">[m.get<i>().begin(), m.get<i>().end())</code>, where <code class="computeroutput">i</code>
+ is the position of the <code class="computeroutput">vector_of</code>
+ view in the container.
+ </li>
</ul></div>
<div class="sidebar">

@@ -1333,10 +1273,10 @@
 
</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>
+ 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">


@@ -1347,23 +1287,23 @@
</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 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
- <code class="computeroutput">iterator</code>, or viceversa.
- </li>
+ 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 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 <code class="computeroutput">iterator</code>, or viceversa.
+ </li>
</ul></div>
</div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -1371,7 +1311,7 @@
</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>
+<a accesskey="p" href="list_of_reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unconstrained_set_of_reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Release notes</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<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="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">
</head>
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="future_work.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rationale.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Release notes">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="boost_bimap.release_notes"></a><a class="link" href="release_notes.html" title="Release notes">Release notes</a>
</h2></div></div></div>
@@ -32,7 +32,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -40,7 +40,7 @@
</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>
+<a accesskey="p" href="future_work.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rationale.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Test suite</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<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="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="next" href="future_work.html" title="Future work">
</head>
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="examples/multiindex_to_bimap_path___hashed_indices.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="future_work.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Test suite">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="boost_bimap.test_suite"></a><a class="link" href="test_suite.html" title="Test suite">Test suite</a>
</h2></div></div></div>
@@ -39,404 +39,405 @@
</colgroup>
<thead><tr>
<th>
- 
- Program
- 
+ 
+ Program
+ 
 </th>
<th>
- 
- Description
- 
+ 
+ Description
+ 
 </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- test_tagged.cpp
- 
+ 
+ test_tagged.cpp
+ 
 </td>
<td>
- 
- Tagged idiom checks
- 
+ 
+ Tagged idiom checks
+ 
 </td>
</tr>
<tr>
<td>
- 
- test_mutant.cpp
- 
+ 
+ test_mutant.cpp
+ 
 </td>
<td>
- 
- Test the mutant idiom
- 
+ 
+ Test the mutant idiom
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/test_structured_pair.cpp" target="_top">test_structured_pair.cpp
- </a>
- 
+ 
+ <a href="../../../test/test_structured_pair.cpp" target="_top">test_structured_pair.cpp
+ </a>
+ 
 </td>
<td>
- 
- Test structured pair class
- 
+ 
+ Test structured pair class
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/test_mutant_relation.cpp" target="_top">test_mutant_relation.cpp
- </a>
- 
+ 
+ <a href="../../../test/test_mutant_relation.cpp" target="_top">test_mutant_relation.cpp
+ </a>
+ 
 </td>
<td>
- 
- Test the relation class
- 
+ 
+ Test the relation class
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/test_bimap_set_of.cpp" target="_top">test_bimap_set_of.cpp
- </a>
- 
+ 
+ <a href="../../../test/test_bimap_set_of.cpp" target="_top">test_bimap_set_of.cpp
+ </a>
+ 
 </td>
<td>
- 
- Library interface check
- 
+ 
+ Library interface check
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/test_bimap_multiset_of.cpp" target="_top">test_bimap_multiset_of.cpp
- </a>
- 
+ 
+ <a href="../../../test/test_bimap_multiset_of.cpp" target="_top">test_bimap_multiset_of.cpp
+ </a>
+ 
 </td>
<td>
- 
- Library interface check
- 
+ 
+ Library interface check
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/test_bimap_unordered_set_of.cpp" target="_top">test_bimap_unordered_set_of.cpp
- </a>
- 
+ 
+ <a href="../../../test/test_bimap_unordered_set_of.cpp" target="_top">test_bimap_unordered_set_of.cpp
+ </a>
+ 
 </td>
<td>
- 
- Library interface check
- 
+ 
+ Library interface check
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/test_bimap_unordered_multiset_of.cpp" target="_top">test_bimap_unordered_multiset_of.cpp
- </a>
- 
+ 
+ <a href="../../../test/test_bimap_unordered_multiset_of.cpp" target="_top">test_bimap_unordered_multiset_of.cpp
+ </a>
+ 
 </td>
<td>
- 
- Library interface check
- 
+ 
+ Library interface check
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/test_bimap_list_of.cpp" target="_top">test_bimap_list_of.cpp
- </a>
- 
+ 
+ <a href="../../../test/test_bimap_list_of.cpp" target="_top">test_bimap_list_of.cpp
+ </a>
+ 
 </td>
<td>
- 
- Library interface check
- 
+ 
+ Library interface check
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/test_bimap_vector_of.cpp" target="_top">test_bimap_vector_of.cpp
- </a>
- 
+ 
+ <a href="../../../test/test_bimap_vector_of.cpp" target="_top">test_bimap_vector_of.cpp
+ </a>
+ 
 </td>
<td>
- 
- Library interface check
- 
+ 
+ Library interface check
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/test_bimap_convenience_header.cpp" target="_top">test_bimap_convenience_header.cpp
- </a>
- 
+ 
+ <a href="../../../test/test_bimap_convenience_header.cpp" target="_top">test_bimap_convenience_header.cpp
+ </a>
+ 
 </td>
<td>
- 
- Library interface check
- 
+ 
+ Library interface check
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/test_bimap_ordered.cpp" target="_top">test_bimap_ordered.cpp
- </a>
- 
+ 
+ <a href="../../../test/test_bimap_ordered.cpp" target="_top">test_bimap_ordered.cpp
+ </a>
+ 
 </td>
<td>
- 
- Test set and multiset based bimaps
- 
+ 
+ Test set and multiset based bimaps
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/test_bimap_unordered.cpp" target="_top">test_bimap_unordered.cpp
- </a>
- 
+ 
+ <a href="../../../test/test_bimap_unordered.cpp" target="_top">test_bimap_unordered.cpp
+ </a>
+ 
 </td>
<td>
- 
- Test unordered_set and unordered_multiset based bimaps
- 
+ 
+ Test unordered_set and unordered_multiset based bimaps
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/test_bimap_sequenced.cpp" target="_top">test_bimap_sequenced.cpp
- </a>
- 
+ 
+ <a href="../../../test/test_bimap_sequenced.cpp" target="_top">test_bimap_sequenced.cpp
+ </a>
+ 
 </td>
<td>
- 
- Test list and vector based bimaps
- 
+ 
+ Test list and vector based bimaps
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/test_bimap_unconstrained.cpp" target="_top">test_bimap_unconstrained.cpp
- </a>
- 
+ 
+ <a href="../../../test/test_bimap_unconstrained.cpp" target="_top">test_bimap_unconstrained.cpp
+ </a>
+ 
 </td>
<td>
- 
- Test bimaps with unconstrained views
- 
+ 
+ Test bimaps with unconstrained views
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/test_bimap_serialization.cpp" target="_top">test_bimap_serialization.cpp
- </a>
- 
+ 
+ <a href="../../../test/test_bimap_serialization.cpp" target="_top">test_bimap_serialization.cpp
+ </a>
+ 
 </td>
<td>
- 
- Serialization support checks
- 
+ 
+ Serialization support checks
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/test_bimap_property_map.cpp" target="_top">test_bimap_property_map.cpp
- </a>
- 
+ 
+ <a href="../../../test/test_bimap_property_map.cpp" target="_top">test_bimap_property_map.cpp
+ </a>
+ 
 </td>
<td>
- 
- Property map concepts for the set and unordered set views
- 
+ 
+ Property map concepts for the set and unordered set views
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/test_bimap_modify.cpp" target="_top">test_bimap_modify.cpp
- </a>
- 
+ 
+ <a href="../../../test/test_bimap_modify.cpp" target="_top">test_bimap_modify.cpp
+ </a>
+ 
 </td>
<td>
- 
- <code class="computeroutput">replace</code>, <code class="computeroutput">modify</code> and <code class="computeroutput">operator[]</code>
- 
+ 
+ <code class="computeroutput">replace</code>, <code class="computeroutput">modify</code> and <code class="computeroutput">operator[]</code>
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/test_bimap_lambda.cpp" target="_top">test_bimap_lambda.cpp
- </a>
- 
+ 
+ <a href="../../../test/test_bimap_lambda.cpp" target="_top">test_bimap_lambda.cpp
+ </a>
+ 
 </td>
<td>
- 
- Test lambda modified idom support
- 
+ 
+ Test lambda modified idom support
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/test_bimap_assign.cpp" target="_top">test_bimap_assign.cpp
- </a>
- 
+ 
+ <a href="../../../test/test_bimap_assign.cpp" target="_top">test_bimap_assign.cpp
+ </a>
+ 
 </td>
<td>
- 
- Test Boost.Assign support
- 
+ 
+ Test Boost.Assign support
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/test_bimap_project.cpp" target="_top">test_bimap_project.cpp
- </a>
- 
+ 
+ <a href="../../../test/test_bimap_project.cpp" target="_top">test_bimap_project.cpp
+ </a>
+ 
 </td>
<td>
- 
- Projection of iterators support
- 
+ 
+ Projection of iterators support
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/test_bimap_operator_bracket.cpp" target="_top">test_bimap_operator_bracket.cpp
- </a>
- 
+ 
+ <a href="../../../test/test_bimap_operator_bracket.cpp" target="_top">test_bimap_operator_bracket.cpp
+ </a>
+ 
 </td>
<td>
- 
- <code class="computeroutput">operator[]</code>
- and <code class="computeroutput">at()</code>
- functions
- 
+ 
+ <code class="computeroutput">operator[]</code>
+ and <code class="computeroutput">at()</code>
+ functions
+ 
 </td>
</tr>
<tr>
<td>
- 
- test_bimap_info.cpp
- 
+ 
+ <a href="../../../test/test_bimap_info.cpp" target="_top">test_bimap_info.cpp
+ </a>
+ 
 </td>
<td>
- 
- Information hooking support
- 
+ 
+ Information hooking support
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/test_bimap_extra.cpp" target="_top">test_bimap_extra.cpp
- </a>
- 
+ 
+ <a href="../../../test/test_bimap_extra.cpp" target="_top">test_bimap_extra.cpp
+ </a>
+ 
 </td>
<td>
- 
- Additional checks
- 
+ 
+ Additional checks
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/compile_fail/test_bimap_info_1.cpp" target="_top">test_bimap_info_1.cpp
- </a>
- 
+ 
+ <a href="../../../test/compile_fail/test_bimap_info_1.cpp" target="_top">test_bimap_info_1.cpp
+ </a>
+ 
 </td>
<td>
- 
- Information hooking compilation fail test
- 
+ 
+ Information hooking compilation fail test
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/compile_fail/test_bimap_info_2.cpp" target="_top">test_bimap_info_2.cpp
- </a>
- 
+ 
+ <a href="../../../test/compile_fail/test_bimap_info_2.cpp" target="_top">test_bimap_info_2.cpp
+ </a>
+ 
 </td>
<td>
- 
- Information hooking compilation fail test
- 
+ 
+ Information hooking compilation fail test
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/compile_fail/test_bimap_info_3.cpp" target="_top">test_bimap_info_3.cpp
- </a>
- 
+ 
+ <a href="../../../test/compile_fail/test_bimap_info_3.cpp" target="_top">test_bimap_info_3.cpp
+ </a>
+ 
 </td>
<td>
- 
- Information hooking compilation fail test
- 
+ 
+ Information hooking compilation fail test
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/compile_fail/test_bimap_mutable_1.cpp" target="_top">test_bimap_mutable_1.cpp
- </a>
- 
+ 
+ <a href="../../../test/compile_fail/test_bimap_mutable_1.cpp" target="_top">test_bimap_mutable_1.cpp
+ </a>
+ 
 </td>
<td>
- 
- Mutable members compilation fail test
- 
+ 
+ Mutable members compilation fail test
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/compile_fail/test_bimap_mutable_2.cpp" target="_top">test_bimap_mutable_2.cpp
- </a>
- 
+ 
+ <a href="../../../test/compile_fail/test_bimap_mutable_2.cpp" target="_top">test_bimap_mutable_2.cpp
+ </a>
+ 
 </td>
<td>
- 
- Mutable members compilation fail test
- 
+ 
+ Mutable members compilation fail test
+ 
 </td>
</tr>
<tr>
<td>
- 
- <a href="../../../test/compile_fail/test_bimap_mutable_3.cpp" target="_top">test_bimap_mutable_3.cpp
- </a>
- 
+ 
+ <a href="../../../test/compile_fail/test_bimap_mutable_3.cpp" target="_top">test_bimap_mutable_3.cpp
+ </a>
+ 
 </td>
<td>
- 
- Mutable members compilation fail test
- 
+ 
+ Mutable members compilation fail test
+ 
 </td>
</tr>
</tbody>
@@ -444,7 +445,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -452,7 +453,7 @@
</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>
+<a accesskey="p" href="examples/multiindex_to_bimap_path___hashed_indices.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="future_work.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>The tutorial</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<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="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">
</head>
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="one_minute_tutorial.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="the_tutorial/discovering_the_bimap_framework.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="The tutorial">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="boost_bimap.the_tutorial"></a><a class="link" href="the_tutorial.html" title="The tutorial">The tutorial</a>
</h2></div></div></div>
@@ -84,69 +84,69 @@
<dt><a href="the_tutorial/complete_instantiation_scheme.html">Complete
 instantiation scheme</a></dt>
</dl></div>
-<div class="section" title="Roadmap">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<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 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 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 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 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 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 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 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 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 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 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 class="link" href="the_tutorial/unconstrained_sets.html" title="Unconstrained Sets">Unconstrained Sets</a>
- explains how they work.
- </li>
-<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 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>
+ 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 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 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 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 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 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 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 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 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 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 class="link" href="the_tutorial/unconstrained_sets.html" title="Unconstrained Sets">Unconstrained Sets</a>
+ explains how they work.
+ </li>
+<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 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>
</ol></div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -154,7 +154,7 @@
</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>
+<a accesskey="p" href="one_minute_tutorial.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="the_tutorial/discovering_the_bimap_framework.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Additional information</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<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">
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="unconstrained_sets.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="complete_instantiation_scheme.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Additional information">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.the_tutorial.additional_information"></a><a class="link" href="additional_information.html" title="Additional information">Additional
 information</a>
@@ -32,9 +32,7 @@
 we want to represent a books and author bidirectional map.
 

- 
-
-
+

<pre class="programlisting">typedef bimap<

@@ -54,20 +52,18 @@
std::cout << bm.right.at( "Modern C++ Design" );
</pre>

- 
-
 

 Suppose now that we want to store abstract of each book. We have two options:
 
<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>
+ 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 class="listitem">
- We can use Boost.MultiIndex for the new beast.
- </li>
+ We can use Boost.MultiIndex for the new beast.
+ </li>
</ol></div>

 Option 1 is the wrong approach, if we go this path we lost what bimap has
@@ -105,9 +101,7 @@
 constructor.
 

- 
-
-
+

<pre class="programlisting">typedef bimap<

@@ -138,22 +132,16 @@
std::cout << i->info;
</pre>

- 
-
 

 Contrary to the two key types, the information will be mutable using iterators.
 

- 
-
-
+

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

- 
-
 

 A new function is included in unique map views: <code class="computeroutput">info_at(key)</code>, that
@@ -161,25 +149,19 @@
 but returned the associated information instead of the data.
 

- 
-
-
+

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

- 
-
 

 The info member can be tagged just as the left or the right member. The following
 is a rewrite of the above example using user defined names:
 

- 
-
-
+

<pre class="programlisting">typedef bimap<

@@ -217,8 +199,6 @@
std::cout << bm.by<title>().info_at("The C++ Programming Language");
</pre>

- 
-
 

 <a href="../../../../example/tutorial_info_hook.cpp" target="_top">Go to source code</a>
@@ -226,7 +206,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -234,7 +214,7 @@
</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>
+<a accesskey="p" href="unconstrained_sets.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="complete_instantiation_scheme.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Bimaps with user defined names</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<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">
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="useful_functions.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unconstrained_sets.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Bimaps with user defined names">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<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>
@@ -35,9 +35,7 @@
 <a href="../../../../example/user_defined_names.cpp" target="_top">Go to source code</a>
 

- 
-
-
+

<pre class="programlisting">typedef bimap
<
@@ -85,8 +83,6 @@
}
</pre>

- 
-
 

 In Boost.Bimap there is a better way to document the code and in the meantime
@@ -114,9 +110,7 @@
 <a href="../../../../example/user_defined_names.cpp" target="_top">Go to source code</a>
 

- 
-
-
+

<pre class="programlisting">struct id {}; // Tag for the identification number
struct name {}; // Tag for the name of the person
@@ -157,8 +151,6 @@
}
</pre>

- 
-
 

 Here is a list of common structures in both tagged and untagged versions.
@@ -181,7 +173,7 @@
bm_type::right_iterator right_iter = bm.right.begin();
</pre>
<div class="table">
-<a name="id577416"></a>Table 1.3. Equivalence of expresions using user defined names
+<a name="id782992"></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>
@@ -189,184 +181,184 @@
</colgroup>
<thead><tr>
<th>
- 
- Untagged version
- 
- </th>
+ 
+ Untagged version
+ 
+ </th>
<th>
- 
- Tagged version
- 
- </th>
+ 
+ Tagged version
+ 
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- <code class="computeroutput">bm.left</code>
- 
- </td>
+ 
+ <code class="computeroutput">bm.left</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">bm.by<Left>()</code>
- 
- </td>
+ 
+ <code class="computeroutput">bm.by<Left>()</code>
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">bm.right</code>
- 
- </td>
+ 
+ <code class="computeroutput">bm.right</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">bm.by<Right>()</code>
- 
- </td>
+ 
+ <code class="computeroutput">bm.by<Right>()</code>
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">bm_type::left_map</code>
- 
- </td>
+ 
+ <code class="computeroutput">bm_type::left_map</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">bm::map_by<Left>::type</code>
- 
- </td>
+ 
+ <code class="computeroutput">bm::map_by<Left>::type</code>
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">bm_type::right_value_type</code>
- 
- </td>
+ 
+ <code class="computeroutput">bm_type::right_value_type</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">bm::map_by<Right>::value_type</code>
- 
- </td>
+ 
+ <code class="computeroutput">bm::map_by<Right>::value_type</code>
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">bm_type::left_iterator</code>
- 
- </td>
+ 
+ <code class="computeroutput">bm_type::left_iterator</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">bm::map_by<Left>::iterator</code>
- 
- </td>
+ 
+ <code class="computeroutput">bm::map_by<Left>::iterator</code>
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">bm_type::right_const_iterator</code>
- 
- </td>
+ 
+ <code class="computeroutput">bm_type::right_const_iterator</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">bm::map_by<Right>::const_iterator</code>
- 
- </td>
+ 
+ <code class="computeroutput">bm::map_by<Right>::const_iterator</code>
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">iter->left</code>
- 
- </td>
+ 
+ <code class="computeroutput">iter->left</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">iter->get<Left>()</code>
- 
- </td>
+ 
+ <code class="computeroutput">iter->get<Left>()</code>
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">iter->right</code>
- 
- </td>
+ 
+ <code class="computeroutput">iter->right</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">iter->get<Right>()</code>
- 
- </td>
+ 
+ <code class="computeroutput">iter->get<Right>()</code>
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">left_iter->first</code>
- 
- </td>
+ 
+ <code class="computeroutput">left_iter->first</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">left_iter->get<Left>()</code>
- 
- </td>
+ 
+ <code class="computeroutput">left_iter->get<Left>()</code>
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">left_iter->second</code>
- 
- </td>
+ 
+ <code class="computeroutput">left_iter->second</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">left_iter->get<Right>()</code>
- 
- </td>
+ 
+ <code class="computeroutput">left_iter->get<Right>()</code>
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">right_iter->first</code>
- 
- </td>
+ 
+ <code class="computeroutput">right_iter->first</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">right_iter->get<Right>()</code>
- 
- </td>
+ 
+ <code class="computeroutput">right_iter->get<Right>()</code>
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">right_iter->second</code>
- 
- </td>
+ 
+ <code class="computeroutput">right_iter->second</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">right_iter->get<Left>()</code>
- 
- </td>
+ 
+ <code class="computeroutput">right_iter->get<Left>()</code>
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">bm.project_left(iter)</code>
- 
- </td>
+ 
+ <code class="computeroutput">bm.project_left(iter)</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">bm.project<Left>(iter)</code>
- 
- </td>
+ 
+ <code class="computeroutput">bm.project<Left>(iter)</code>
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">bm.project_right(iter)</code>
- 
- </td>
+ 
+ <code class="computeroutput">bm.project_right(iter)</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">bm.project<Right>(iter)</code>
- 
- </td>
+ 
+ <code class="computeroutput">bm.project<Right>(iter)</code>
+ 
+ </td>
</tr>
</tbody>
</table></div>
@@ -375,7 +367,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -383,7 +375,7 @@
</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>
+<a accesskey="p" href="useful_functions.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unconstrained_sets.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Complete instantiation scheme</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<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="next" href="../bimap_and_boost.html" title="Bimap and Boost">
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="additional_information.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../bimap_and_boost.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Complete instantiation scheme">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<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>
@@ -53,56 +53,55 @@
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- Left type: <code class="computeroutput">Type</code>
-</li>
+ Left type: <code class="computeroutput">Type</code>
+ </li>
<li class="listitem">
- Left collection type: <code class="computeroutput">set_of< Type ></code>
-</li>
+ Left collection type: <code class="computeroutput">set_of< Type
+ ></code>
+ </li>
<li class="listitem">
- Left tag: <code class="computeroutput">member_at::left</code>
-</li>
+ Left tag: <code class="computeroutput">member_at::left</code>
+ </li>
</ul></div>
<pre class="programlisting">bimap< {CollectionType}_of< Type >, R >
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- Left type: <code class="computeroutput">Type</code>
-</li>
+ Left type: <code class="computeroutput">Type</code>
+ </li>
<li class="listitem">
- Left collection type: <code class="computeroutput">{CollectionType}_of< LeftType
- ></code>
-</li>
+ Left collection type: <code class="computeroutput">{CollectionType}_of< LeftType ></code>
+ </li>
<li class="listitem">
- Left tag: <code class="computeroutput">member_at::left</code>
-</li>
+ Left tag: <code class="computeroutput">member_at::left</code>
+ </li>
</ul></div>
<pre class="programlisting">bimap< tagged< Type, Tag >, R >
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- Left type: <code class="computeroutput">Type</code>
-</li>
+ Left type: <code class="computeroutput">Type</code>
+ </li>
<li class="listitem">
- Left collection type: <code class="computeroutput">set_of< LeftType
- ></code>
-</li>
+ Left collection type: <code class="computeroutput">set_of< LeftType
+ ></code>
+ </li>
<li class="listitem">
- Left tag: <code class="computeroutput">Tag</code>
-</li>
+ Left tag: <code class="computeroutput">Tag</code>
+ </li>
</ul></div>
<pre class="programlisting">bimap< {CollectionType}_of< tagged< Type, Tag > >, R >
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- Left type: <code class="computeroutput">Type</code>
-</li>
+ Left type: <code class="computeroutput">Type</code>
+ </li>
<li class="listitem">
- Left collection type: <code class="computeroutput">{CollectionType}_of< LeftType
- ></code>
-</li>
+ Left collection type: <code class="computeroutput">{CollectionType}_of< LeftType ></code>
+ </li>
<li class="listitem">
- Left tag: <code class="computeroutput">Tag</code>
-</li>
+ Left tag: <code class="computeroutput">Tag</code>
+ </li>
</ul></div>

 The same options are available for the second parameter.
@@ -127,107 +126,107 @@
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- set_of_relation_type: based on the left key type
- </li>
+ set_of_relation_type: based on the left key type
+ </li>
<li class="listitem">
- info: no info
- </li>
+ info: no info
+ </li>
<li class="listitem">
- allocator: std::allocator
- </li>
+ allocator: std::allocator
+ </li>
</ul></div>
<pre class="programlisting">bimap< L, R ,SetOfRelationType>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- set_of_relation_type: SetOfRelationType
- </li>
+ set_of_relation_type: SetOfRelationType
+ </li>
<li class="listitem">
- info: no info
- </li>
+ info: no info
+ </li>
<li class="listitem">
- allocator: std::allocator
- </li>
+ allocator: std::allocator
+ </li>
</ul></div>
<pre class="programlisting">bimap< L, R , SetOfRelationType, with_info<Info> >
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- set_of_relation_type: SetOfRelationType
- </li>
+ set_of_relation_type: SetOfRelationType
+ </li>
<li class="listitem">
- info: Info
- </li>
+ info: Info
+ </li>
<li class="listitem">
- allocator: std::allocator
- </li>
+ allocator: std::allocator
+ </li>
</ul></div>
<pre class="programlisting">bimap< L, R , SetOfRelationType, with_info<Info>, Allocator>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- set_of_relation_type: SetOfRelationType
- </li>
+ set_of_relation_type: SetOfRelationType
+ </li>
<li class="listitem">
- info: Info
- </li>
+ info: Info
+ </li>
<li class="listitem">
- allocator: Allocator
- </li>
+ allocator: Allocator
+ </li>
</ul></div>
<pre class="programlisting">bimap< L, R , SetOfRelationType, Allocator>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- set_of_relation_type: SetOfRelationType
- </li>
+ set_of_relation_type: SetOfRelationType
+ </li>
<li class="listitem">
- info: no info
- </li>
+ info: no info
+ </li>
<li class="listitem">
- allocator: Allocator
- </li>
+ allocator: Allocator
+ </li>
</ul></div>
<pre class="programlisting">bimap< L, R , with_info<Info> >
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- set_of_relation_type: based on the left key type
- </li>
+ set_of_relation_type: based on the left key type
+ </li>
<li class="listitem">
- info: Info
- </li>
+ info: Info
+ </li>
<li class="listitem">
- allocator: std::allocator
- </li>
+ allocator: std::allocator
+ </li>
</ul></div>
<pre class="programlisting">bimap< L, R , with_info<Info>, Allocator>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- set_of_relation_type: based on the left key type
- </li>
+ set_of_relation_type: based on the left key type
+ </li>
<li class="listitem">
- allocator: Allocator
- </li>
+ allocator: Allocator
+ </li>
</ul></div>
<pre class="programlisting">bimap< L, R , Allocator>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- set_of_relation_type: based on the left key type
- </li>
+ set_of_relation_type: based on the left key type
+ </li>
<li class="listitem">
- info: no info
- </li>
+ info: no info
+ </li>
<li class="listitem">
- allocator: Allocator
- </li>
+ allocator: Allocator
+ </li>
</ul></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -235,7 +234,7 @@
</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>
+<a accesskey="p" href="additional_information.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../bimap_and_boost.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Controlling collection types</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<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">
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="discovering_the_bimap_framework.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="the_collection_of_relations_type.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Controlling collection types">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<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>
@@ -34,7 +34,7 @@
 parameters</a></dt>
<dt>Examples</dt>
</dl></div>
-<div class="section" title="Freedom of choice">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<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>
@@ -59,7 +59,7 @@
 The following is the list of all supported collection types.
 
<div class="table">
-<a name="id561624"></a>Table 1.2. Collection of Key Types
+<a name="id767190"></a>Table 1.2. Collection of Key Types
<div class="table-contents"><table class="table" summary="Collection of Key Types">
<colgroup>
<col>
@@ -68,140 +68,140 @@
</colgroup>
<thead><tr>
<th>
- 
- name
- 
- </th>
+ 
+ name
+ 
+ </th>
<th>
- 
- Features
- 
- </th>
+ 
+ Features
+ 
+ </th>
<th>
- 
- map view type
- 
- </th>
+ 
+ map view type
+ 
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- <code class="computeroutput">set_of</code>
- 
- </td>
+ 
+ <code class="computeroutput">set_of</code>
+ 
+ </td>
<td>
- 
- ordered, unique
- 
- </td>
+ 
+ ordered, unique
+ 
+ </td>
<td>
- 
- <code class="computeroutput">map</code>
- 
- </td>
+ 
+ <code class="computeroutput">map</code>
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">multiset_of</code>
- 
- </td>
+ 
+ <code class="computeroutput">multiset_of</code>
+ 
+ </td>
<td>
- 
- ordered 
- 
- </td>
+ 
+ ordered 
+ 
+ </td>
<td>
- 
- <code class="computeroutput">multimap</code>
- 
- </td>
+ 
+ <code class="computeroutput">multimap</code>
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">unordered_set_of</code>
- 
- </td>
+ 
+ <code class="computeroutput">unordered_set_of</code>
+ 
+ </td>
<td>
- 
- hashed, unique 
- 
- </td>
+ 
+ hashed, unique 
+ 
+ </td>
<td>
- 
- <code class="computeroutput">unordered_map</code>
- 
- </td>
+ 
+ <code class="computeroutput">unordered_map</code>
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">unordered_multiset_of</code>
- 
- </td>
+ 
+ <code class="computeroutput">unordered_multiset_of</code>
+ 
+ </td>
<td>
- 
- hashed 
- 
- </td>
+ 
+ hashed 
+ 
+ </td>
<td>
- 
- <code class="computeroutput">unordered_multimap</code>
- 
- </td>
+ 
+ <code class="computeroutput">unordered_multimap</code>
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">list_of</code>
- 
- </td>
+ 
+ <code class="computeroutput">list_of</code>
+ 
+ </td>
<td>
- 
- sequenced 
- 
- </td>
+ 
+ sequenced 
+ 
+ </td>
<td>
- 
- <code class="computeroutput">list_map</code>
- 
- </td>
+ 
+ <code class="computeroutput">list_map</code>
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">vector_of</code>
- 
- </td>
+ 
+ <code class="computeroutput">vector_of</code>
+ 
+ </td>
<td>
- 
- random access 
- 
- </td>
+ 
+ random access 
+ 
+ </td>
<td>
- 
- <code class="computeroutput">vector_map</code>
- 
- </td>
+ 
+ <code class="computeroutput">vector_map</code>
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">unconstrained_set_of</code>
- 
- </td>
+ 
+ <code class="computeroutput">unconstrained_set_of</code>
+ 
+ </td>
<td>
- 
- unconstrained 
- 
- </td>
+ 
+ unconstrained 
+ 
+ </td>
<td>
- 
- can not be viewed
- 
- </td>
+ 
+ can not be viewed
+ 
+ </td>
</tr>
</tbody>
</table></div>
@@ -229,16 +229,16 @@
 
<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>
+ <code class="computeroutput">bm.left</code> is signature-compatible with
+ LeftMapType<code class="computeroutput"><A,B></code>
+ </li>
<li class="listitem">
-<code class="computeroutput">bm.right</code> is signature-compatible with
- RightMapType<code class="computeroutput"><B,A></code>
-</li>
+ <code class="computeroutput">bm.right</code> is signature-compatible with
+ RightMapType<code class="computeroutput"><B,A></code>
+ </li>
</ul></div>
</div>
-<div class="section" title="Configuration parameters">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<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>
@@ -261,98 +261,99 @@
</colgroup>
<thead><tr>
<th>
- 
- name
- 
+ 
+ name
+ 
 </th>
<th>
- 
- Additional Parameters
- 
+ 
+ Additional Parameters
+ 
 </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- <code class="computeroutput">set_of<T,KeyComp></code>
- 
- 
- <code class="computeroutput">multiset_of<T,KeyComp></code>
- 
+ 
+ <code class="computeroutput">set_of<T,KeyComp></code>
+ 
+ 
+ <code class="computeroutput">multiset_of<T,KeyComp></code>
+ 
 </td>
<td>
- 
- KeyComp is a Functor that compares
- two types using a less-than operator. By default, this is <code class="computeroutput">std::less<T></code>.
- 
+ 
+ KeyComp is a Functor that compares
+ two types using a less-than operator. By default, this is <code class="computeroutput">std::less<T></code>.
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">unordered_set_of<T,HashFunctor,EqualKey></code>
- 
- 
- <code class="computeroutput">unordered_multiset_of<T,HashFunctor,EqualKey></code>
- 
+ 
+ <code class="computeroutput">unordered_set_of<T,HashFunctor,EqualKey></code>
+ 
+ 
+ <code class="computeroutput">unordered_multiset_of<T,HashFunctor,EqualKey></code>
+ 
 </td>
<td>
- 
- HashFunctor converts a <code class="computeroutput">T</code> object into an <code class="computeroutput">std::size_t</code> value. By default it is
- <code class="computeroutput">boost::hash<T></code>.
- 
- 
- EqualKey is a Functor that tests
- two types for equality. By default, the equality operator is <code class="computeroutput">std::equal_to<T></code>.
- 
+ 
+ HashFunctor converts a <code class="computeroutput">T</code> object into an <code class="computeroutput">std::size_t</code> value. By default it
+ is <code class="computeroutput">boost::hash<T></code>.
+ 
+ 
+ EqualKey is a Functor that
+ tests two types for equality. By default, the equality operator
+ is <code class="computeroutput">std::equal_to<T></code>.
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">list_of<T></code>
- 
+ 
+ <code class="computeroutput">list_of<T></code>
+ 
 </td>
<td>
- 
- No additional parameters.
- 
+ 
+ No additional parameters.
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">vector_of<T></code>
- 
+ 
+ <code class="computeroutput">vector_of<T></code>
+ 
 </td>
<td>
- 
- No additional parameters.
- 
+ 
+ No additional parameters.
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">unconstrained_set_of<T></code>
- 
+ 
+ <code class="computeroutput">unconstrained_set_of<T></code>
+ 
 </td>
<td>
- 
- No additional parameters.
- 
+ 
+ No additional parameters.
+ 
 </td>
</tr>
</tbody>
</table></div>
</div>
-<div class="section" title="Examples">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<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="id562688"></a>
+<a name="id768285"></a>
 <a class="link" href="controlling_collection_types.html#boost_bimap.the_tutorial.controlling_collection_types.examples.countries_populations">Countries
 Populations</a>
 </h6>
@@ -361,11 +362,11 @@
 
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
- Get a list of countries in decresing order of their populations.
- </li>
+ Get a list of countries in decresing order of their populations.
+ </li>
<li class="listitem">
- Given a countrie, get their population.
- </li>
+ Given a countrie, get their population.
+ </li>
</ol></div>

 Lets create the appropiate bimap.
@@ -394,9 +395,7 @@
 <a href="../../../../example/population_bimap.cpp" target="_top">Go to source code</a>
 

- 
-
-
+

<pre class="programlisting">typedef bimap<

@@ -418,7 +417,7 @@
std::cout << "Countries by their population:" << std::endl;

// First requirement
-<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
+<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 )
{
@@ -426,33 +425,29 @@
}

// Second requirement
-<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;
+<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>

- 
+ 

 
-
- 
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
<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>
+ 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 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>
+ 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>
</tr>
</table></div>

- 
-
 
<a name="boost_bimap.the_tutorial.controlling_collection_types.examples.repetitions_counter"></a><h6>
-<a name="id563860"></a>
+<a name="id769726"></a>
 <a class="link" href="controlling_collection_types.html#boost_bimap.the_tutorial.controlling_collection_types.examples.repetitions_counter">Repetitions
 counter</a>
 </h6>
@@ -464,14 +459,12 @@
 <a href="../../../../example/repetitions_counter.cpp" target="_top">Go to source code</a>
 

- 
-
-
+

<pre class="programlisting">typedef bimap
<
 unordered_set_of< std::string >,
- 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>
+ 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;

@@ -492,11 +485,11 @@
for( text_tokenizer::const_iterator it = tok.begin(), it_end = tok.end();
 it != it_end ; ++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];
+ <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 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
+<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 )
@@ -505,39 +498,35 @@
}
</pre>

- 
+ 

 
-
- 
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
<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>
+<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 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>
+ 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 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>
+<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>
</table></div>

- 
-
 
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -545,7 +534,7 @@
</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>
+<a accesskey="p" href="discovering_the_bimap_framework.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="the_collection_of_relations_type.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Differences with standard maps</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<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="next" href="useful_functions.html" title="Useful functions">
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="the_collection_of_relations_type.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="useful_functions.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Differences with standard maps">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<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>
@@ -35,7 +35,7 @@
<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" title="Insertion">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<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>
@@ -67,7 +67,7 @@
 allowed by it too.
 
</div>
-<div class="section" title="iterator::value_type">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<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>
@@ -102,99 +102,99 @@
</colgroup>
<thead><tr>
<th>
- 
- Side collection type
- 
+ 
+ Side collection type
+ 
 </th>
<th>
- 
- Dereferenced data
- 
+ 
+ Dereferenced data
+ 
 </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- <code class="computeroutput">set_of</code>
- 
+ 
+ <code class="computeroutput">set_of</code>
+ 
 </td>
<td>
- 
- constant
- 
+ 
+ constant
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">multiset_of</code>
- 
+ 
+ <code class="computeroutput">multiset_of</code>
+ 
 </td>
<td>
- 
- constant
- 
+ 
+ constant
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">unordered_set_of</code>
- 
+ 
+ <code class="computeroutput">unordered_set_of</code>
+ 
 </td>
<td>
- 
- constant
- 
+ 
+ constant
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">unordered_multiset_of</code>
- 
+ 
+ <code class="computeroutput">unordered_multiset_of</code>
+ 
 </td>
<td>
- 
- constant
- 
+ 
+ constant
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">list_of</code>
- 
+ 
+ <code class="computeroutput">list_of</code>
+ 
 </td>
<td>
- 
- mutable
- 
+ 
+ mutable
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">vector_of</code>
- 
+ 
+ <code class="computeroutput">vector_of</code>
+ 
 </td>
<td>
- 
- mutable
- 
+ 
+ mutable
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">unconstrained_set_of</code>
- 
+ 
+ <code class="computeroutput">unconstrained_set_of</code>
+ 
 </td>
<td>
- 
- mutable
- 
+ 
+ mutable
+ 
 </td>
</tr>
</tbody>
@@ -210,137 +210,137 @@
</colgroup>
<thead><tr>
<th>
- 
- Bimap type
- 
+ 
+ Bimap type
+ 
 </th>
<th>
- 
- Signature-compatible types
- 
+ 
+ Signature-compatible types
+ 
 </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- <code class="computeroutput">bimap<A,B></code>
- 
- </td>
-<td>
- 
- <code class="computeroutput">iterator </code> -> <code class="computeroutput">relation<const
- A,const B></code>
- 
- 
- <code class="computeroutput">left_iterator </code>
- -> <code class="computeroutput">pair<const
- A,const B></code>
- 
- 
- <code class="computeroutput">right_iterator</code>
- -> <code class="computeroutput">pair<const
- B,const A></code>
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- <code class="computeroutput">bimap<multiset_of<A>,unordered_set_of<B>
- ></code>
- 
- </td>
-<td>
- 
- <code class="computeroutput">iterator </code> -> <code class="computeroutput">relation<const
- A,const B></code>
- 
- 
- <code class="computeroutput">left_iterator </code>
- -> <code class="computeroutput">pair<const
- A,const B></code>
- 
- 
- <code class="computeroutput">right_iterator</code>
- -> <code class="computeroutput">pair<const
- B,const A></code>
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- <code class="computeroutput">bimap<set_of<A>,list_of<B>
- ></code>
- 
- </td>
-<td>
- 
- <code class="computeroutput">iterator </code> -> <code class="computeroutput">relation<const
- A,B></code>
- 
- 
- <code class="computeroutput">left_iterator </code>
- -> <code class="computeroutput">pair<const
- A,B></code>
- 
- 
- <code class="computeroutput">right_iterator</code>
- -> <code class="computeroutput">pair<B,const
- A></code>
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- <code class="computeroutput">bimap<vector_of<A>,set_of<B>
- ></code>
- 
- </td>
-<td>
- 
- <code class="computeroutput">iterator </code> -> <code class="computeroutput">relation<A,const
- B></code>
- 
- 
- <code class="computeroutput">left_iterator </code>
- -> <code class="computeroutput">pair<A,const
- B></code>
- 
- 
- <code class="computeroutput">right_iterator</code>
- -> <code class="computeroutput">pair<const
- B,A></code>
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- <code class="computeroutput">bimap<list_of<A>,unconstrained_set_of<B>
- ></code>
- 
- </td>
-<td>
- 
- <code class="computeroutput">iterator </code> -> <code class="computeroutput">relation<A,B></code>
- 
- 
- <code class="computeroutput">left_iterator </code>
- -> <code class="computeroutput">pair<A,B></code>
- 
- 
- <code class="computeroutput">right_iterator</code>
- -> <code class="computeroutput">pair<B,A></code>
- 
+ 
+ <code class="computeroutput">bimap<A,B></code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">iterator </code> -> <code class="computeroutput">relation<const
+ A,const B></code>
+ 
+ 
+ <code class="computeroutput">left_iterator </code>
+ -> <code class="computeroutput">pair<const
+ A,const B></code>
+ 
+ 
+ <code class="computeroutput">right_iterator</code>
+ -> <code class="computeroutput">pair<const
+ B,const A></code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">bimap<multiset_of<A>,unordered_set_of<B>
+ ></code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">iterator </code> -> <code class="computeroutput">relation<const
+ A,const B></code>
+ 
+ 
+ <code class="computeroutput">left_iterator </code>
+ -> <code class="computeroutput">pair<const
+ A,const B></code>
+ 
+ 
+ <code class="computeroutput">right_iterator</code>
+ -> <code class="computeroutput">pair<const
+ B,const A></code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">bimap<set_of<A>,list_of<B>
+ ></code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">iterator </code> -> <code class="computeroutput">relation<const
+ A,B></code>
+ 
+ 
+ <code class="computeroutput">left_iterator </code>
+ -> <code class="computeroutput">pair<const
+ A,B></code>
+ 
+ 
+ <code class="computeroutput">right_iterator</code>
+ -> <code class="computeroutput">pair<B,const
+ A></code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">bimap<vector_of<A>,set_of<B>
+ ></code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">iterator </code> -> <code class="computeroutput">relation<A,const
+ B></code>
+ 
+ 
+ <code class="computeroutput">left_iterator </code>
+ -> <code class="computeroutput">pair<A,const
+ B></code>
+ 
+ 
+ <code class="computeroutput">right_iterator</code>
+ -> <code class="computeroutput">pair<const
+ B,A></code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">bimap<list_of<A>,unconstrained_set_of<B>
+ ></code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">iterator </code> -> <code class="computeroutput">relation<A,B></code>
+ 
+ 
+ <code class="computeroutput">left_iterator </code>
+ -> <code class="computeroutput">pair<A,B></code>
+ 
+ 
+ <code class="computeroutput">right_iterator</code>
+ -> <code class="computeroutput">pair<B,A></code>
+ 
 </td>
</tr>
</tbody>
</table></div>
</div>
-<div class="section" title="operator[] and at()">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<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>
@@ -379,9 +379,7 @@
 <a href="../../../../example/at_function_examples.cpp" target="_top">Go to source code</a>
 

- 
-
-
+

<pre class="programlisting">typedef bimap< set_of< std::string >, list_of< int > > bm_type;
bm_type bm;
@@ -399,13 +397,9 @@
assert( bm.left.at("one") == 1 ); // Ok
</pre>

- 
-
 

- 
-
-
+

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

</pre>

- 
-
 
</div>
-<div class="section" title="Complexity of operations">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<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>
@@ -443,7 +435,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -451,7 +443,7 @@
</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>
+<a accesskey="p" href="the_collection_of_relations_type.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="useful_functions.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Discovering the bimap framework</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<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">
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="controlling_collection_types.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Discovering the bimap framework">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<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>
@@ -35,7 +35,7 @@
<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" title="Interpreting bidirectional maps">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<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>
@@ -51,7 +51,7 @@
 and data from the left collection.
 
</div>
-<div class="section" title="Standard mapping framework">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<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>
@@ -73,7 +73,7 @@
 containers.
 
<div class="table">
-<a name="id559754"></a>Table 1.1. std associative containers
+<a name="id765312"></a>Table 1.1. std associative containers
<div class="table-contents"><table class="table" summary="std associative containers">
<colgroup>
<col>
@@ -82,96 +82,96 @@
</colgroup>
<thead><tr>
<th>
- 
- container
- 
- </th>
+ 
+ container
+ 
+ </th>
<th>
- 
- left collection type
- 
- </th>
+ 
+ left collection type
+ 
+ </th>
<th>
- 
- right collection type
- 
- </th>
+ 
+ right collection type
+ 
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- <code class="computeroutput">map</code>
- 
- </td>
-<td>
- 
- <code class="computeroutput">set_of</code>
- 
- </td>
-<td>
- 
- no constraints
- 
- </td>
+ 
+ <code class="computeroutput">map</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">set_of</code>
+ 
+ </td>
+<td>
+ 
+ no constraints
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">multimap</code>
- 
- </td>
-<td>
- 
- <code class="computeroutput">multiset_of</code>
- 
- </td>
-<td>
- 
- no constraints
- 
- </td>
+ 
+ <code class="computeroutput">multimap</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">multiset_of</code>
+ 
+ </td>
+<td>
+ 
+ no constraints
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">unordered_map</code>
- 
- </td>
-<td>
- 
- <code class="computeroutput">unordered_set_of</code>
- 
- </td>
-<td>
- 
- no constraints
- 
- </td>
+ 
+ <code class="computeroutput">unordered_map</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">unordered_set_of</code>
+ 
+ </td>
+<td>
+ 
+ no constraints
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">unordered_multimap</code>
- 
- </td>
-<td>
- 
- <code class="computeroutput">unordered_multiset_of</code>
- 
- </td>
-<td>
- 
- no constraints
- 
- </td>
+ 
+ <code class="computeroutput">unordered_multimap</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">unordered_multiset_of</code>
+ 
+ </td>
+<td>
+ 
+ no constraints
+ 
+ </td>
</tr>
</tbody>
</table></div>
</div>
 
</div>
-<div class="section" title="Bimap mapping framework">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<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>
@@ -215,9 +215,9 @@
 The following code snippet shows the relation between a bimap and standard
 maps.
 
-<div class="note" title="Note"><table border="0" summary="Note">
+<div class="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>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
<tr><td align="left" valign="top">
@@ -239,9 +239,7 @@
 <a href="../../../../example/standard_map_comparison.cpp" target="_top">Go to source code</a>
 

- 
-
-
+

<pre class="programlisting">template< class Map, class CompatibleKey, class CompatibleData >
void use_it( Map & m,
@@ -304,14 +302,12 @@
}
</pre>

- 
-
 
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -319,7 +315,7 @@
</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>
+<a accesskey="p" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="controlling_collection_types.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>The collection of relations type</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<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">
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="controlling_collection_types.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="differences_with_standard_maps.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="The collection of relations type">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<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>
@@ -34,7 +34,7 @@
 parameters</a></dt>
<dt>Examples</dt>
</dl></div>
-<div class="section" title="A new point of view">
+<div class="section">
<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 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>
@@ -62,36 +62,36 @@
 
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- left_based
- </li>
+ left_based
+ </li>
<li class="listitem">
- right_based
- </li>
+ right_based
+ </li>
<li class="listitem">
- set_of_relation<>
- </li>
+ set_of_relation<>
+ </li>
<li class="listitem">
- multiset_of_relation<>
- </li>
+ multiset_of_relation<>
+ </li>
<li class="listitem">
- unordered_set_of_relation<>
- </li>
+ unordered_set_of_relation<>
+ </li>
<li class="listitem">
- unordered_multiset_of_relation<>
- </li>
+ unordered_multiset_of_relation<>
+ </li>
<li class="listitem">
- list_of_relation
- </li>
+ list_of_relation
+ </li>
<li class="listitem">
- vector_of_relation
- </li>
+ vector_of_relation
+ </li>
<li class="listitem">
- unconstrained_set_of_relation
- </li>
+ unconstrained_set_of_relation
+ </li>
</ul></div>
-<div class="tip" title="Tip"><table border="0" summary="Tip">
+<div class="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>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Tip]" src="../../../../../../doc/src/images/tip.png"></td>
<th align="left">Tip</th>
</tr>
<tr><td align="left" valign="top">
@@ -118,9 +118,7 @@
 <a href="../../../../example/mighty_bimap.cpp" target="_top">Go to source code</a>
 

- 
-
-
+

<pre class="programlisting">#include <iostream>
#include <string>
@@ -205,11 +203,9 @@
}
</pre>

- 
-
 
</div>
-<div class="section" title="Configuration parameters">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<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>
@@ -236,119 +232,119 @@
</colgroup>
<thead><tr>
<th>
- 
- name
- 
+ 
+ name
+ 
 </th>
<th>
- 
- Additional Parameters
- 
+ 
+ Additional Parameters
+ 
 </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- <code class="computeroutput">left_based</code>
- 
+ 
+ <code class="computeroutput">left_based</code>
+ 
 </td>
<td>
- 
- Not a template.
- 
+ 
+ Not a template.
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">right_based</code>
- 
+ 
+ <code class="computeroutput">right_based</code>
+ 
 </td>
<td>
- 
- Not a template.
- 
+ 
+ Not a template.
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">set_of_relation<KeyComp></code>
- 
- 
- <code class="computeroutput">multiset_of_relation<KeyComp></code>
- 
+ 
+ <code class="computeroutput">set_of_relation<KeyComp></code>
+ 
+ 
+ <code class="computeroutput">multiset_of_relation<KeyComp></code>
+ 
 </td>
<td>
- 
- KeyComp is a Functor that compares
- two types using less than. By default, the less-than operator is
- <code class="computeroutput">std::less<_relation></code>.
- 
+ 
+ KeyComp is a Functor that compares
+ two types using less than. By default, the less-than operator
+ is <code class="computeroutput">std::less<_relation></code>.
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">unordered_set_of_relation<HashFunctor,EqualKey></code>
- 
- 
- <code class="computeroutput">unordered_multiset_of_relation<HashFunctor,EqualKey></code>
- 
- </td>
-<td>
- 
- HashFunctor converts the <code class="computeroutput">relation</code> into an <code class="computeroutput">std::size_t</code> value. By default it is
- <code class="computeroutput">boost::hash<_relation></code>.
- 
- 
- EqualKey is a Functor that tests
- two relations for equality. By default, the equality operator is
- <code class="computeroutput">std::equal_to<_relation></code>.
- 
+ 
+ <code class="computeroutput">unordered_set_of_relation<HashFunctor,EqualKey></code>
+ 
+ 
+ <code class="computeroutput">unordered_multiset_of_relation<HashFunctor,EqualKey></code>
+ 
+ </td>
+<td>
+ 
+ HashFunctor converts the <code class="computeroutput">relation</code> into an <code class="computeroutput">std::size_t</code> value. By default it
+ is <code class="computeroutput">boost::hash<_relation></code>.
+ 
+ 
+ EqualKey is a Functor that
+ tests two relations for equality. By default, the equality operator
+ is <code class="computeroutput">std::equal_to<_relation></code>.
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">list_of_relation</code>
- 
+ 
+ <code class="computeroutput">list_of_relation</code>
+ 
 </td>
<td>
- 
- Not a template.
- 
+ 
+ Not a template.
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">vector_of_relation</code>
- 
+ 
+ <code class="computeroutput">vector_of_relation</code>
+ 
 </td>
<td>
- 
- Not a template.
- 
+ 
+ Not a template.
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">unconstrained_set_of_relation</code>
- 
+ 
+ <code class="computeroutput">unconstrained_set_of_relation</code>
+ 
 </td>
<td>
- 
- Not a template.
- 
+ 
+ Not a template.
+ 
 </td>
</tr>
</tbody>
</table></div>
</div>
-<div class="section" title="Examples">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<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>
@@ -398,7 +394,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -406,7 +402,7 @@
</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>
+<a accesskey="p" href="controlling_collection_types.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="differences_with_standard_maps.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Unconstrained Sets</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<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">
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="bimaps_with_user_defined_names.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="additional_information.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Unconstrained Sets">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.the_tutorial.unconstrained_sets"></a><a class="link" href="unconstrained_sets.html" title="Unconstrained Sets">Unconstrained
 Sets</a>
@@ -38,26 +38,24 @@
 
<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>
+ 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 class="listitem">
- You can view the mapping as a collection of relations.
- </li>
+ You can view the mapping as a collection of relations.
+ </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>.
- </li>
+ 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>.
+ </li>
</ul></div>

 Given this bimap instance,
 

- 
-
-
+

<pre class="programlisting">typedef bimap< std::string, unconstrained_set_of<int> > bm_type;
typedef bm_type::left_map map_type;
@@ -66,32 +64,24 @@
map_type & m = bm.left;
</pre>

- 
-
 

 or this standard map one
 

- 
-
-
+

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

map_type m;
</pre>

- 
-
 

 The following code snippet is valid
 

- 
-
-
+

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

@@ -99,38 +89,32 @@

for( map_type::iterator i = m.begin(), iend = m.end(); i != iend; ++i )
{
- <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);
+ <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");
</pre>

- 
+ 

 
-
- 
<div class="calloutlist"><table border="0" summary="Callout list"><tr>
<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>
+ using iterators. </td>
</tr></table></div>

- 
-
 

 But using a bimap has some benefits
 

- 
-
-
+

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

-<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" );
+<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;
@@ -139,19 +123,15 @@
m.modify_key( m.begin(), _key = "1" );
</pre>

- 
+ 

 
-
- 
<div class="calloutlist"><table border="0" summary="Callout list"><tr>
<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>
+ for more information. </td>
</tr></table></div>

- 
-
 

 <a href="../../../../example/unconstrained_collection.cpp" target="_top">Go to source code</a>
@@ -159,7 +139,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -167,7 +147,7 @@
</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>
+<a accesskey="p" href="bimaps_with_user_defined_names.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="additional_information.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

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 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Useful functions</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<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">
@@ -13,16 +13,16 @@
<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">Libraries</td>
+<td align="center">Libraries</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>
+<a accesskey="p" href="differences_with_standard_maps.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="bimaps_with_user_defined_names.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Useful functions">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<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>
@@ -34,7 +34,7 @@
<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" title="Projection of iterators">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<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>
@@ -55,9 +55,7 @@
 <a href="../../../../example/projection.cpp" target="_top">Go to source code</a>
 

- 
-
-
+

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

@@ -77,11 +75,9 @@
std::cout << "The next younger person after Peter is " << years_iter->second;
</pre>

- 
-
 
</div>
-<div class="section" title="replace and modify">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<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>
@@ -100,9 +96,7 @@
 code</a>
 

- 
-
-
+

<pre class="programlisting">typedef bimap< int, std::string > bm_type;
bm_type bm;
@@ -128,24 +122,20 @@

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

- <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 );
+ <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>

- 
+ 

 
-
- 
<div class="calloutlist"><table border="0" summary="Callout list"><tr>
<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>
+ and the bimap was left unchanged </td>
</tr></table></div>

- 
-
 

 <code class="computeroutput">replace</code> functions performs
@@ -153,17 +143,17 @@
 
<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>
+ The complexity is constant time if the changed element retains its
+ original order with respect to all views; it is logarithmic otherwise.
+ </li>
<li class="listitem">
- Iterator and reference validity are preserved.
- </li>
+ Iterator and reference validity are preserved.
+ </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.
- </li>
+ 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.
+ </li>
</ul></div>

 <code class="computeroutput">replace</code> functions are powerful
@@ -209,9 +199,7 @@
 code</a>
 

- 
-
-
+

<pre class="programlisting">typedef bimap< int, std::string > bm_type;
bm_type bm;
@@ -236,27 +224,23 @@

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

- <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 );
+ <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>

- 
+ 

 
-
- 
<div class="calloutlist"><table border="0" summary="Callout list"><tr>
<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>
+ and <code class="computeroutput">(1,"1")</code> is removed from the bimap </td>
</tr></table></div>

- 
-
 
</div>
-<div class="section" title="Retrieval of ranges">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<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>
@@ -271,9 +255,7 @@
 <code class="computeroutput">[20,50]</code>
 

- 
-
-
+

<pre class="programlisting">typedef bimap<int,std::string> bm_type;
bm_type bm;
@@ -286,8 +268,6 @@
// range [iter_first,iter_second) contains the elements in [20,50]
</pre>

- 
-
 

 Subtle changes to the code are required when strict inequalities are considered.
@@ -295,9 +275,7 @@
 to be rewritten as
 

- 
-
-
+

<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);
@@ -305,8 +283,6 @@
// range [iter_first,iter_second) contains the elements in (20,50)
</pre>

- 
-
 

 To add to this complexity, the careful programmer has to take into account
@@ -322,46 +298,41 @@
 can greatly help alleviate this situation:
 

- 
-
-
+

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

// ...

-<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 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 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]
+<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)

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

- 
+ 

 
-
- 
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
<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>
+<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 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>
+ To use it you have to include <code class="computeroutput"><boost/bimap/support/lambda.hpp></code>
+ </td>
</tr>
</table></div>

- 
-
 

 <code class="computeroutput">range</code> simply accepts predicates
@@ -373,29 +344,23 @@
 One or both bounds can be omitted with the special unbounded marker:
 

- 
-
-
+

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

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

-<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)
+<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>

- 
+ 

 
-
- 
<div class="calloutlist"><table border="0" summary="Callout list"><tr>
<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>

- 
-
 

 <a href="../../../../example/tutorial_range.cpp" target="_top">Go to source code</a>
@@ -404,7 +369,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto
 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)
 
@@ -412,7 +377,7 @@
</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>
+<a accesskey="p" href="differences_with_standard_maps.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="bimaps_with_user_defined_names.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: trunk/libs/bimap/doc/html/index.html
==============================================================================
--- trunk/libs/bimap/doc/html/index.html (original)
+++ trunk/libs/bimap/doc/html/index.html 2010-07-19 16:17:18 EDT (Mon, 19 Jul 2010)
@@ -1,33 +1,33 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Chapter 1. Boost.Bimap</title>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Chapter 1. Boost.Bimap</title>
<link rel="stylesheet" href="boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="index.html" title="Chapter 1. Boost.Bimap">
+<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">Libraries</td>
+<td align="center">Libraries</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" title="Chapter 1. Boost.Bimap">
+<div class="spirit-nav"><a accesskey="n" href="boost_bimap/introduction.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a></div>
+<div class="chapter">
<div class="titlepage"><div>
<div><h2 class="title">
-<a name="bimap"></a>Chapter 1. Boost.Bimap</h2></div>
+<a name="bimap"></a>Chapter 1. Boost.Bimap</h2></div>
<div><div class="author"><h3 class="author">
Matias Capeletto
</h3></div></div>
-<div>Copyright © 2006 -2007 Matias Capeletto</div>
-<div><div class="legalnotice" title="Legal Notice">
-<a name="id553942"></a>
+<div>Copyright © 2006 -2007 Matias Capeletto</div>
+<div><div class="legalnotice">
+<a name="id759689"></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,12 +115,12 @@
<dt>Acknowledgements</dt>
</dl>
</div>
-<div class="section" title="Preface">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<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="id553973"></a>
+<a name="id759719"></a>
 <a class="link" href="index.html#bimap.preface.description">Description</a>
 </h4>

@@ -137,22 +137,22 @@
 containers.
 
<a name="bimap.preface.influences_and_related_work"></a><h4>
-<a name="id554118"></a>
+<a name="id759864"></a>
 <a class="link" href="index.html#bimap.preface.influences_and_related_work">Influences and Related
 Work</a>
 </h4>

 The design of Boost.Bimap interface follows the standard template library.
- It has been strongly influenced by Joaquin Lopez Muñoz's Boost.MultiIndex
+ It has been strongly influenced by Joaquin Lopez Muñoz's Boost.MultiIndex
 library (the heart of bimaps) and codeproject::bimap library.
 
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left">Last revised: November 20, 2009 at 09:43:59 GMT</td>
+<td align="left">Last revised: July 19, 2010 at 19:07:28 GMT</td>
<td align="right"><div class="copyright-footer"></div></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="spirit-nav"><a accesskey="n" href="boost_bimap/introduction.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a></div>
</body>
</html>

Next message: daniel_james_at_[hidden]: "[Boost-commit] svn:boost r64170 - in trunk/libs: numeric/conversion/doc optional/doc"
Previous message: daniel_james_at_[hidden]: "[Boost-commit] svn:boost r64172 - trunk/libs/property_map/doc"

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