Boost-Commit :

Date view	Thread view	Subject view	Author view

Subject: [Boost-commit] svn:boost r81939 - in branches/release: boost/bimap boost/bimap/container_adaptor boost/bimap/detail boost/bimap/relation boost/bimap/support boost/bimap/views libs/bimap libs/bimap/doc libs/bimap/doc/html libs/bimap/doc/html/boost_bimap libs/bimap/doc/html/boost_bimap/bimap_and_boost libs/bimap/doc/html/boost_bimap/examples libs/bimap/doc/html/boost_bimap/history libs/bimap/doc/html/boost_bimap/rationale libs/bimap/doc/html/boost_bimap/reference libs/bimap/doc/html/boost_bimap/the_tutorial libs/bimap/example libs/bimap/test
From: matias.capeletto_at_[hidden]
Date: 2012-12-14 09:22:02

Author: matias
Date: 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
New Revision: 81939
URL: http://svn.boost.org/trac/boost/changeset/81939

Log:
[bimap] Merge to release
Added:
   branches/release/libs/bimap/doc/html/standalone_HTML.manifest
      - copied unchanged from r81938, /trunk/libs/bimap/doc/html/standalone_HTML.manifest
Properties modified:
   branches/release/boost/bimap/ (props changed)
   branches/release/libs/bimap/ (props changed)
Text files modified:
   branches/release/boost/bimap/bimap.hpp | 53 ++-
   branches/release/boost/bimap/container_adaptor/vector_adaptor.hpp | 16
   branches/release/boost/bimap/detail/bimap_core.hpp | 45 ---
   branches/release/boost/bimap/detail/map_view_base.hpp | 61 +--
   branches/release/boost/bimap/detail/map_view_iterator.hpp | 331 +++++++++++++++++-------
   branches/release/boost/bimap/detail/set_view_base.hpp | 4
   branches/release/boost/bimap/relation/mutant_relation.hpp | 46 +++
   branches/release/boost/bimap/relation/structured_pair.hpp | 44 +++
   branches/release/boost/bimap/support/iterator_type_by.hpp | 122 +-------
   branches/release/boost/bimap/views/list_map_view.hpp | 25 -
   branches/release/boost/bimap/views/map_view.hpp | 4
   branches/release/boost/bimap/views/multimap_view.hpp | 4
   branches/release/boost/bimap/views/unconstrained_map_view.hpp | 2
   branches/release/boost/bimap/views/unordered_map_view.hpp | 4
   branches/release/boost/bimap/views/unordered_multimap_view.hpp | 4
   branches/release/boost/bimap/views/vector_map_view.hpp | 40 ++
   branches/release/boost/bimap/views/vector_set_view.hpp | 34 ++
   branches/release/libs/bimap/doc/bimap.qbk | 2
   branches/release/libs/bimap/doc/html/boost_bimap/acknowledgements.html | 13
   branches/release/libs/bimap/doc/html/boost_bimap/bimap_and_boost.html | 14
   branches/release/libs/bimap/doc/html/boost_bimap/bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html | 103 +++----
   branches/release/libs/bimap/doc/html/boost_bimap/bimap_and_boost/dependencies.html | 12
   branches/release/libs/bimap/doc/html/boost_bimap/compiler_specifics.html | 20
   branches/release/libs/bimap/doc/html/boost_bimap/examples.html | 14
   branches/release/libs/bimap/doc/html/boost_bimap/examples/mighty_bimap.html | 25
   branches/release/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___bidirectional_map.html | 107 +++----
   branches/release/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___hashed_indices.html | 46 +-
   branches/release/libs/bimap/doc/html/boost_bimap/examples/simple_bimap.html | 36 +-
   branches/release/libs/bimap/doc/html/boost_bimap/future_work.html | 13
   branches/release/libs/bimap/doc/html/boost_bimap/history.html | 10
   branches/release/libs/bimap/doc/html/boost_bimap/history/multiindex_and_bimap.html | 20
   branches/release/libs/bimap/doc/html/boost_bimap/introduction.html | 113 ++++----
   branches/release/libs/bimap/doc/html/boost_bimap/one_minute_tutorial.html | 139 +++++-----
   branches/release/libs/bimap/doc/html/boost_bimap/performance.html | 6
   branches/release/libs/bimap/doc/html/boost_bimap/rationale.html | 20
   branches/release/libs/bimap/doc/html/boost_bimap/rationale/additional_features.html | 28 +-
   branches/release/libs/bimap/doc/html/boost_bimap/rationale/code.html | 10
   branches/release/libs/bimap/doc/html/boost_bimap/rationale/the_student_and_the_mentor.html | 10
   branches/release/libs/bimap/doc/html/boost_bimap/reference.html | 18
   branches/release/libs/bimap/doc/html/boost_bimap/reference/bimap_reference.html | 134 +++++-----
   branches/release/libs/bimap/doc/html/boost_bimap/reference/list_of_reference.html | 182 +++++++------
   branches/release/libs/bimap/doc/html/boost_bimap/reference/set_of_reference.html | 527 +++++++++++++++++++--------------------
   branches/release/libs/bimap/doc/html/boost_bimap/reference/unconstrained_set_of_reference.html | 48 +-
   branches/release/libs/bimap/doc/html/boost_bimap/reference/unordered_set_of_reference.html | 367 +++++++++++++--------------
   branches/release/libs/bimap/doc/html/boost_bimap/reference/vector_of_reference.html | 183 +++++++------
   branches/release/libs/bimap/doc/html/boost_bimap/release_notes.html | 77 +++++
   branches/release/libs/bimap/doc/html/boost_bimap/test_suite.html | 6
   branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial.html | 8
   branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/additional_information.html | 61 ++--
   branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/bimaps_with_user_defined_names.html | 50 +-
   branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/complete_instantiation_scheme.html | 38 +-
   branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/controlling_collection_types.html | 60 ++--
   branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/differences_with_standard_maps.html | 59 ++--
   branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/discovering_the_bimap_framework.html | 37 +-
   branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/the_collection_of_relations_type.html | 33 +-
   branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/unconstrained_sets.html | 20
   branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/useful_functions.html | 99 +++----
   branches/release/libs/bimap/doc/html/index.html | 24
   branches/release/libs/bimap/doc/release_notes.qbk | 25 +
   branches/release/libs/bimap/example/step_by_step.cpp | 2
   branches/release/libs/bimap/example/tutorial_modify_and_replace.cpp | 2
   branches/release/libs/bimap/test/test_bimap.hpp | 92 ++++++
   branches/release/libs/bimap/test/test_bimap_extra.cpp | 11
   branches/release/libs/bimap/test/test_bimap_modify.cpp | 66 +++++
   branches/release/libs/bimap/test/test_bimap_sequenced.cpp | 319 +++++++++++------------
   65 files changed, 2240 insertions(+), 1908 deletions(-)

Modified: branches/release/boost/bimap/bimap.hpp
==============================================================================
--- branches/release/boost/bimap/bimap.hpp (original)
+++ branches/release/boost/bimap/bimap.hpp 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -166,28 +166,37 @@
 /*
 // The rest is computed in the core, because it is quite difficult to
 // expose a nice interface with so many metaprogramming stuff.
- // Here it is the complete metadat list.
-
+
 // Map by {side} metadata

 typedef -unspecified- {side}_tag;
 typedef -unspecified- {side}_data_type;
 typedef -unspecified- {side}_value_type;
 typedef -unspecified- {side}_key_type;
- typedef -unspecified- {side}_iterator;
- typedef -unspecified- {side}_const_iterator;
-
+
+ // There are other typedefs for definitions of different map views
+
 ------------------------------------------------------------------*/

 typedef BOOST_DEDUCED_TYPENAME ::boost::bimaps::detail::
 left_map_view_type<base_>::type left_map;
 typedef BOOST_DEDUCED_TYPENAME ::boost::bimaps::detail::
 right_map_view_type<base_>::type right_map;
+
+ typedef BOOST_DEDUCED_TYPENAME
+ left_map::iterator left_iterator;
+ typedef BOOST_DEDUCED_TYPENAME
+ left_map::const_iterator left_const_iterator;
+
+ typedef BOOST_DEDUCED_TYPENAME
+ right_map::iterator right_iterator;
+ typedef BOOST_DEDUCED_TYPENAME
+ right_map::const_iterator right_const_iterator;

 typedef BOOST_DEDUCED_TYPENAME
- left_map::reference left_reference;
+ left_map::reference left_reference;
 typedef BOOST_DEDUCED_TYPENAME
- left_map::const_reference left_const_reference;
+ left_map::const_reference left_const_reference;

 typedef BOOST_DEDUCED_TYPENAME
 right_map::reference right_reference;
@@ -239,16 +248,19 @@
 const allocator_type& al = allocator_type()) :

 base_::relation_set(
- ::boost::multi_index::get<logic_relation_set_tag>(core)
+ ::boost::multi_index::get<
+ BOOST_DEDUCED_TYPENAME base_::logic_relation_set_tag>(core)
 ),

 core(first,last,ctor_args_list(),al),

 left (
- ::boost::multi_index::get<logic_left_tag>(core)
+ ::boost::multi_index::get<
+ BOOST_DEDUCED_TYPENAME base_::logic_left_tag>(core)
 ),
 right (
- ::boost::multi_index::get<logic_right_tag>(core)
+ ::boost::multi_index::get<
+ BOOST_DEDUCED_TYPENAME base_::logic_right_tag>(core)
 )

 {}
@@ -256,16 +268,19 @@
 bimap(const bimap& x) :

 base_::relation_set(
- ::boost::multi_index::get<logic_relation_set_tag>(core)
+ ::boost::multi_index::get<
+ BOOST_DEDUCED_TYPENAME base_::logic_relation_set_tag>(core)
 ),

 core(x.core),

 left (
- ::boost::multi_index::get<logic_left_tag>(core)
+ ::boost::multi_index::get<
+ BOOST_DEDUCED_TYPENAME base_::logic_left_tag>(core)
 ),
 right (
- ::boost::multi_index::get<logic_right_tag>(core)
+ ::boost::multi_index::get<
+ BOOST_DEDUCED_TYPENAME base_::logic_right_tag>(core)
 )

 {}
@@ -279,32 +294,28 @@
 // Projection of iterators

 template< class IteratorType >
- BOOST_DEDUCED_TYPENAME base_::left_iterator
- project_left(IteratorType iter)
+ left_iterator project_left(IteratorType iter)
 {
 return core.template project<
 BOOST_DEDUCED_TYPENAME base_::logic_left_tag>(iter.base());
 }

 template< class IteratorType >
- BOOST_DEDUCED_TYPENAME base_::left_const_iterator
- project_left(IteratorType iter) const
+ left_const_iterator project_left(IteratorType iter) const
 {
 return core.template project<
 BOOST_DEDUCED_TYPENAME base_::logic_left_tag>(iter.base());
 }

 template< class IteratorType >
- BOOST_DEDUCED_TYPENAME base_::right_iterator
- project_right(IteratorType iter)
+ right_iterator project_right(IteratorType iter)
 {
 return core.template project<
 BOOST_DEDUCED_TYPENAME base_::logic_right_tag>(iter.base());
 }

 template< class IteratorType >
- BOOST_DEDUCED_TYPENAME base_::right_const_iterator
- project_right(IteratorType iter) const
+ right_const_iterator project_right(IteratorType iter) const
 {
 return core.template project<
 BOOST_DEDUCED_TYPENAME base_::logic_right_tag>(iter.base());

Modified: branches/release/boost/bimap/container_adaptor/vector_adaptor.hpp
==============================================================================
--- branches/release/boost/bimap/container_adaptor/vector_adaptor.hpp (original)
+++ branches/release/boost/bimap/container_adaptor/vector_adaptor.hpp 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -109,25 +109,33 @@
 BOOST_DEDUCED_TYPENAME base_::const_reference
 operator[](BOOST_DEDUCED_TYPENAME base_::size_type n) const
 {
- return this->base().operator[](n);
+ return this->template functor<BOOST_DEDUCED_TYPENAME base_::value_from_base>()(
+ this->base().operator[](n)
+ );
 }

 BOOST_DEDUCED_TYPENAME base_::const_reference
 at(BOOST_DEDUCED_TYPENAME base_::size_type n) const
 {
- return this->base().at(n);
+ return this->template functor<BOOST_DEDUCED_TYPENAME base_::value_from_base>()(
+ this->base().at(n)
+ );
 }

 BOOST_DEDUCED_TYPENAME base_::reference
 operator[](BOOST_DEDUCED_TYPENAME base_::size_type n)
 {
- return this->base().operator[](n);
+ return this->template functor<BOOST_DEDUCED_TYPENAME base_::value_from_base>()(
+ this->base().operator[](n)
+ );
 }

 BOOST_DEDUCED_TYPENAME base_::reference
 at(BOOST_DEDUCED_TYPENAME base_::size_type n)
 {
- return this->base().at(n);
+ return this->template functor<BOOST_DEDUCED_TYPENAME base_::value_from_base>()(
+ this->base().at(n)
+ );
 }
};

Modified: branches/release/boost/bimap/detail/bimap_core.hpp
==============================================================================
--- branches/release/boost/bimap/detail/bimap_core.hpp (original)
+++ branches/release/boost/bimap/detail/bimap_core.hpp 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -425,50 +425,6 @@
 typedef BOOST_DEDUCED_TYPENAME right_index::iterator right_core_iterator;
 typedef BOOST_DEDUCED_TYPENAME right_index::const_iterator right_core_const_iterator;

- // Map by {side} iterator metadata
- // --------------------------------------------------------------------
- public:
-
- //@{
-
- typedef ::boost::bimaps::detail::map_view_iterator
- <
- left_tag,
- relation,
- left_core_iterator
-
- > left_iterator;
-
- typedef ::boost::bimaps::detail::map_view_iterator
- <
- right_tag,
- relation,
- right_core_iterator
-
- > right_iterator;
-
- //@}
-
- //@{
-
- typedef ::boost::bimaps::detail::const_map_view_iterator
- <
- left_tag,
- relation,
- left_core_const_iterator
-
- > left_const_iterator;
-
- typedef ::boost::bimaps::detail::const_map_view_iterator
- <
- right_tag,
- relation,
- right_core_const_iterator
-
- > right_const_iterator;
-
- //@}
-
 // Relation set view

 typedef BOOST_DEDUCED_TYPENAME ::boost::multi_index::index
@@ -513,6 +469,7 @@
>::type type;
};

+
} // namespace detail
} // namespace bimaps
} // namespace boost

Modified: branches/release/boost/bimap/detail/map_view_base.hpp
==============================================================================
--- branches/release/boost/bimap/detail/map_view_base.hpp (original)
+++ branches/release/boost/bimap/detail/map_view_base.hpp 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -31,12 +31,13 @@
#include <boost/bimap/relation/support/data_extractor.hpp>
#include <boost/bimap/relation/support/opposite_tag.hpp>
#include <boost/bimap/relation/support/pair_type_by.hpp>
-#include <boost/bimap/support/iterator_type_by.hpp>
+//#include <boost/bimap/support/iterator_type_by.hpp>
#include <boost/bimap/support/key_type_by.hpp>
#include <boost/bimap/support/data_type_by.hpp>
#include <boost/bimap/support/value_type_by.hpp>
#include <boost/bimap/detail/modifier_adaptor.hpp>
#include <boost/bimap/detail/debug/static_error.hpp>
+#include <boost/bimap/detail/map_view_iterator.hpp>

namespace boost {
namespace bimaps {
@@ -47,27 +48,20 @@
// The next macro can be converted in a metafunctor to gain code robustness.
/*===========================================================================*/
#define BOOST_BIMAP_MAP_VIEW_CONTAINER_ADAPTOR( \
- CONTAINER_ADAPTOR, TAG,BIMAP, OTHER_ITER, CONST_OTHER_ITER \
+ CONTAINER_ADAPTOR, TAG, BIMAP, OTHER_ITER, CONST_OTHER_ITER \
) \
::boost::bimaps::container_adaptor::CONTAINER_ADAPTOR \
< \
 BOOST_DEDUCED_TYPENAME BIMAP::core_type:: \
 BOOST_NESTED_TEMPLATE index<TAG>::type, \
- BOOST_DEDUCED_TYPENAME ::boost::bimaps::support:: \
- iterator_type_by<TAG,BIMAP>::type, \
- BOOST_DEDUCED_TYPENAME ::boost::bimaps::support:: \
- const_iterator_type_by<TAG,BIMAP>::type, \
- BOOST_DEDUCED_TYPENAME ::boost::bimaps::support:: \
- OTHER_ITER<TAG,BIMAP>::type, \
- BOOST_DEDUCED_TYPENAME ::boost::bimaps::support:: \
- CONST_OTHER_ITER<TAG,BIMAP>::type, \
+ ::boost::bimaps::detail:: map_view_iterator<TAG,BIMAP>, \
+ ::boost::bimaps::detail::const_map_view_iterator<TAG,BIMAP>, \
+ ::boost::bimaps::detail:: OTHER_ITER<TAG,BIMAP>, \
+ ::boost::bimaps::detail::CONST_OTHER_ITER<TAG,BIMAP>, \
 ::boost::bimaps::container_adaptor::support::iterator_facade_to_base \
 < \
- BOOST_DEDUCED_TYPENAME ::boost::bimaps::support:: \
- iterator_type_by<TAG,BIMAP>::type, \
- BOOST_DEDUCED_TYPENAME ::boost::bimaps::support:: \
- const_iterator_type_by<TAG,BIMAP>::type \
- \
+ ::boost::bimaps::detail:: map_view_iterator<TAG,BIMAP>, \
+ ::boost::bimaps::detail::const_map_view_iterator<TAG,BIMAP> \
>, \
 ::boost::mpl::na, \
 ::boost::mpl::na, \
@@ -102,13 +96,8 @@
{
 typedef ::boost::bimaps::container_adaptor::support::
 iterator_facade_to_base<
-
- BOOST_DEDUCED_TYPENAME ::boost::bimaps::support::
- iterator_type_by<Tag,BimapType>::type,
-
- BOOST_DEDUCED_TYPENAME ::boost::bimaps::support::
- const_iterator_type_by<Tag,BimapType>::type
-
+ ::boost::bimaps::detail:: map_view_iterator<Tag,BimapType>,
+ ::boost::bimaps::detail::const_map_view_iterator<Tag,BimapType>
> iterator_to_base_;

 typedef ::boost::bimaps::relation::detail::
@@ -125,8 +114,8 @@
 pair_type_by<Tag,
 BOOST_DEDUCED_TYPENAME BimapType::relation>::type value_type_;

- typedef BOOST_DEDUCED_TYPENAME ::boost::bimaps::support::
- iterator_type_by<Tag,BimapType>::type iterator_;
+ typedef
+ ::boost::bimaps::detail::map_view_iterator<Tag,BimapType> iterator_;

 public:

@@ -144,7 +133,8 @@
 return derived().base().replace(
 derived().template functor<iterator_to_base_>()(position),
 derived().template functor<value_to_base_>()(
- value_type_(k,position->second)
+ ::boost::bimaps::relation::detail::
+ copy_with_first_replaced(*position,k)
 )
 );
 }
@@ -155,7 +145,8 @@
 return derived().base().replace(
 derived().template functor<iterator_to_base_>()(position),
 derived().template functor<value_to_base_>()(
- value_type_(position->first,d)
+ ::boost::bimaps::relation::detail::
+ copy_with_second_replaced(*position,d)
 )
 );
 }
@@ -263,8 +254,8 @@
 template< class CompatibleKey >
 data_type_ & at(const CompatibleKey& k)
 {
- typedef BOOST_DEDUCED_TYPENAME ::boost::bimaps::support::
- iterator_type_by<Tag,BimapType>::type iterator;
+ typedef ::boost::bimaps::detail::
+ map_view_iterator<Tag,BimapType> iterator;

 iterator iter = derived().find(k);
 if( iter == derived().end() )
@@ -279,8 +270,8 @@
 template< class CompatibleKey >
 const data_type_ & at(const CompatibleKey& k) const
 {
- typedef BOOST_DEDUCED_TYPENAME ::boost::bimaps::support::
- const_iterator_type_by<Tag,BimapType>::type const_iterator;
+ typedef ::boost::bimaps::detail::
+ const_map_view_iterator<Tag,BimapType> const_iterator;

 const_iterator iter = derived().find(k);
 if( iter == derived().end() )
@@ -295,8 +286,8 @@
 template< class CompatibleKey >
 data_type_ & operator[](const CompatibleKey& k)
 {
- typedef BOOST_DEDUCED_TYPENAME ::boost::bimaps::support::
- iterator_type_by<Tag,BimapType>::type iterator;
+ typedef ::boost::bimaps::detail::
+ map_view_iterator<Tag,BimapType> iterator;

 typedef BOOST_DEDUCED_TYPENAME ::boost::bimaps::support::
 value_type_by<Tag,BimapType>::type value_type;
@@ -341,8 +332,8 @@
 template< class CompatibleKey >
 const data_type_ & at(const CompatibleKey& k) const
 {
- typedef BOOST_DEDUCED_TYPENAME ::boost::bimaps::support::
- const_iterator_type_by<Tag,BimapType>::type const_iterator;
+ typedef ::boost::bimaps::detail::
+ const_map_view_iterator<Tag,BimapType> const_iterator;

 const_iterator iter = derived().find(k);
 if( iter == derived().end() )
@@ -493,7 +484,7 @@
 const BOOST_DEDUCED_TYPENAME BASE::value_type& v) \
{ \
 this->clear(); \
- for(BOOST_DEDUCED_TYPENAME BASE::size_type i = 0 ; i < n ; ++n) \
+ for(BOOST_DEDUCED_TYPENAME BASE::size_type i = 0 ; i < n ; ++i) \
 { \
 this->push_back(v); \
 } \

Modified: branches/release/boost/bimap/detail/map_view_iterator.hpp
==============================================================================
--- branches/release/boost/bimap/detail/map_view_iterator.hpp (original)
+++ branches/release/boost/bimap/detail/map_view_iterator.hpp 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -28,50 +28,101 @@
#include <boost/iterator/iterator_adaptor.hpp>
#include <boost/bimap/relation/support/pair_by.hpp>

+// check
+#include <boost/bimap/relation/detail/metadata_access_builder.hpp>
+#include <boost/bimap/relation/detail/static_access_builder.hpp>
+
namespace boost {
namespace bimaps {
namespace detail {

-#ifndef BOOST_BIMAP_DOXYGEN_WILL_NOT_PROCESS_THE_FOLLOWING_LINES
+/** \brief Map View Iterator adaptors from multi index to bimap.

-template< class Tag, class Relation, class CoreIterator > struct map_view_iterator;
+These classes are based on transform iterators from Boost.Iterator.
+ **/

-template< class Tag, class Relation, class CoreIterator >
-struct map_view_iterator_base
-{
- typedef iterator_adaptor
- <
- map_view_iterator< Tag, Relation, CoreIterator >,
- CoreIterator,
- BOOST_DEDUCED_TYPENAME ::boost::bimaps::relation::support::
- pair_type_by<Tag,Relation>::type
+template< class Tag, class BimapCore > struct map_view_iterator ;
+template< class Tag, class BimapCore > struct const_map_view_iterator ;

- > type;
-};
-
-#endif // BOOST_BIMAP_DOXYGEN_WILL_NOT_PROCESS_THE_FOLLOWING_LINES
+template< class Tag, class BimapCore > struct reverse_map_view_iterator ;
+template< class Tag, class BimapCore > struct const_reverse_map_view_iterator ;

-/** \brief Map View Iterator adaptor from multi index to bimap.
+template< class Tag, class BimapCore > struct local_map_view_iterator ;
+template< class Tag, class BimapCore > struct const_local_map_view_iterator ;

-This is class is based on transform iterator from Boost.Iterator that is
-modified to allow serialization. It has been specialized for this
-library, and EBO optimization was applied to the functor.

- **/
+#ifndef BOOST_BIMAP_DOXYGEN_WILL_NOT_PROCESS_THE_FOLLOWING_LINES

-template< class Tag, class Relation, class CoreIterator >
-struct map_view_iterator : public map_view_iterator_base<Tag,Relation,CoreIterator>::type
+#ifndef BOOST_BIMAP_DISABLE_SERIALIZATION
+/*===========================================================================*/
+#define BOOST_BIMAP_MAP_VIEW_ITERATOR_SERIALIZATION_SUPPORT \
+ BOOST_SERIALIZATION_SPLIT_MEMBER() \
+ \
+ friend class ::boost::serialization::access; \
+ \
+ template< class Archive > \
+ void save(Archive & ar, const unsigned int) const \
+ { \
+ ar << ::boost::serialization::make_nvp("mi_iterator",this->base()); \
+ } \
+ \
+ template< class Archive > \
+ void load(Archive & ar, const unsigned int) \
+ { \
+ BOOST_DEDUCED_TYPENAME base_::base_type iter; \
+ ar >> ::boost::serialization::make_nvp("mi_iterator",iter); \
+ this->base_reference() = iter; \
+ }
+/*===========================================================================*/
+#else
+#define BOOST_BIMAP_MAP_VIEW_ITERATOR_SERIALIZATION_SUPPORT // None
+#endif // BOOST_BIMAP_DISABLE_SERIALIZATION
+
+/*===========================================================================*/
+#define BOOST_BIMAP_CORE_ITERATOR_TYPE_BY_BUILDER( METANAME, ITERATOR ) \
+BOOST_BIMAP_SYMMETRIC_STATIC_ACCESS_BUILDER( METANAME, BimapCore, \
+ typedef BOOST_DEDUCED_TYPENAME BimapCore::core_type::BOOST_NESTED_TEMPLATE\
+ index<BOOST_DEDUCED_TYPENAME BimapCore::left_tag> \
+ ::type::ITERATOR type, \
+ typedef BOOST_DEDUCED_TYPENAME BimapCore::core_type::BOOST_NESTED_TEMPLATE\
+ index<BOOST_DEDUCED_TYPENAME BimapCore::right_tag> \
+ ::type::ITERATOR type \
+)
+/*===========================================================================*/
+
+
+BOOST_BIMAP_CORE_ITERATOR_TYPE_BY_BUILDER( core_iterator_type_by
+ , iterator )
+
+BOOST_BIMAP_CORE_ITERATOR_TYPE_BY_BUILDER( reverse_core_iterator_type_by
+ , reverse_iterator )
+
+BOOST_BIMAP_CORE_ITERATOR_TYPE_BY_BUILDER( local_core_iterator_type_by
+ , local_iterator )
+
+
+// map_view_iterator
+
+template< class Tag, class BimapCore >
+struct map_view_iterator_adaptor {
+ typedef iterator_adaptor<
+ map_view_iterator<Tag,BimapCore>,
+ BOOST_DEDUCED_TYPENAME core_iterator_type_by<Tag,BimapCore>::type,
+ BOOST_DEDUCED_TYPENAME
+ ::boost::bimaps::support::value_type_by<Tag,BimapCore>::type
+ > type;
+};
+template< class Tag, class BimapCore >
+struct map_view_iterator :
+ public map_view_iterator_adaptor<Tag,BimapCore>::type
{
- typedef BOOST_DEDUCED_TYPENAME
- map_view_iterator_base<Tag,Relation,CoreIterator>::type base_;
-
+ typedef BOOST_DEDUCED_TYPENAME
+ map_view_iterator_adaptor<Tag,BimapCore>::type base_;
 public:

 map_view_iterator() {}
-
- map_view_iterator(CoreIterator const& iter)
+ map_view_iterator(BOOST_DEDUCED_TYPENAME base_::base_type const& iter)
 : base_(iter) {}
-
 map_view_iterator(map_view_iterator const & iter)
 : base_(iter.base()) {}

@@ -83,117 +134,203 @@
 )
 );
 }
-
 private:
-
 friend class iterator_core_access;
+ BOOST_BIMAP_MAP_VIEW_ITERATOR_SERIALIZATION_SUPPORT
+};

- #ifndef BOOST_BIMAP_DISABLE_SERIALIZATION
-
- // Serialization support
-
- BOOST_SERIALIZATION_SPLIT_MEMBER()

- friend class ::boost::serialization::access;
+template< class Tag, class BimapCore >
+struct const_map_view_iterator_adaptor {
+ typedef iterator_adaptor<
+ const_map_view_iterator<Tag,BimapCore>,
+ BOOST_DEDUCED_TYPENAME core_iterator_type_by<Tag,BimapCore>::type,
+ const BOOST_DEDUCED_TYPENAME
+ ::boost::bimaps::support::value_type_by<Tag,BimapCore>::type
+ > type;
+};
+template< class Tag, class BimapCore >
+struct const_map_view_iterator :
+ public const_map_view_iterator_adaptor<Tag,BimapCore>::type
+{
+ typedef BOOST_DEDUCED_TYPENAME
+ const_map_view_iterator_adaptor<Tag,BimapCore>::type base_;
+ public:

- template< class Archive >
- void save(Archive & ar, const unsigned int) const
- {
- ar << ::boost::serialization::make_nvp("mi_iterator",this->base());
- }
+ const_map_view_iterator() {}
+ const_map_view_iterator(
+ BOOST_DEDUCED_TYPENAME base_::base_type const& iter)
+ : base_(iter) {}
+ const_map_view_iterator(const_map_view_iterator const & iter)
+ : base_(iter.base()) {}
+ const_map_view_iterator(map_view_iterator<Tag,BimapCore> i)
+ : base_(i.base()) {}

- template< class Archive >
- void load(Archive & ar, const unsigned int)
+ BOOST_DEDUCED_TYPENAME base_::reference dereference() const
 {
- CoreIterator iter;
- ar >> ::boost::serialization::make_nvp("mi_iterator",iter);
- this->base_reference() = iter;
+ return ::boost::bimaps::relation::support::pair_by<Tag>(*this->base());
 }
-
- #endif // BOOST_BIMAP_DISABLE_SERIALIZATION
+ private:
+ friend class iterator_core_access;
+ BOOST_BIMAP_MAP_VIEW_ITERATOR_SERIALIZATION_SUPPORT
};

-#ifndef BOOST_BIMAP_DOXYGEN_WILL_NOT_PROCESS_THE_FOLLOWING_LINES
-
-template< class Tag, class Relation, class CoreIterator > struct const_map_view_iterator;
-
-template< class Tag, class Relation, class CoreIterator >
-struct const_map_view_iterator_base
-{
- typedef iterator_adaptor
- <
- const_map_view_iterator< Tag, Relation, CoreIterator >,
- CoreIterator,
- const BOOST_DEDUCED_TYPENAME ::boost::bimaps::relation::support::
- pair_type_by<Tag,Relation>::type
+// reverse_map_view_iterator

+template< class Tag, class BimapCore >
+struct reverse_map_view_iterator_adaptor {
+ typedef iterator_adaptor<
+ reverse_map_view_iterator<Tag,BimapCore>,
+ BOOST_DEDUCED_TYPENAME
+ reverse_core_iterator_type_by<Tag,BimapCore>::type,
+ BOOST_DEDUCED_TYPENAME
+ ::boost::bimaps::support::value_type_by<Tag,BimapCore>::type
> type;
};
+template< class Tag, class BimapCore >
+struct reverse_map_view_iterator :
+ public reverse_map_view_iterator_adaptor<Tag,BimapCore>::type
+{
+ typedef BOOST_DEDUCED_TYPENAME
+ reverse_map_view_iterator_adaptor<Tag,BimapCore>::type base_;
+ public:

-#endif // BOOST_BIMAP_DOXYGEN_WILL_NOT_PROCESS_THE_FOLLOWING_LINES
-
-
-/** \brief Const Map View Iterator adaptor from multi index to bimap.
-
-See also map_view_iterator.
- **/
+ reverse_map_view_iterator() {}
+ reverse_map_view_iterator(
+ BOOST_DEDUCED_TYPENAME base_::base_type const& iter)
+ : base_(iter) {}
+ reverse_map_view_iterator(reverse_map_view_iterator const & iter)
+ : base_(iter.base()) {}

-template< class Tag, class Relation, class CoreIterator >
-struct const_map_view_iterator :
+ BOOST_DEDUCED_TYPENAME base_::reference dereference() const
+ {
+ return ::boost::bimaps::relation::support::pair_by<Tag>(
+ *const_cast<BOOST_DEDUCED_TYPENAME base_::base_type::value_type*>(
+ &(*this->base())
+ )
+ );
+ }
+ private:
+ friend class iterator_core_access;
+ BOOST_BIMAP_MAP_VIEW_ITERATOR_SERIALIZATION_SUPPORT
+};

- public const_map_view_iterator_base<Tag,Relation,CoreIterator>::type
+template< class Tag, class BimapCore >
+struct const_reverse_map_view_iterator_adaptor {
+ typedef iterator_adaptor<
+ const_reverse_map_view_iterator<Tag,BimapCore>,
+ BOOST_DEDUCED_TYPENAME
+ reverse_core_iterator_type_by<Tag,BimapCore>::type,
+ const BOOST_DEDUCED_TYPENAME
+ ::boost::bimaps::support::value_type_by<Tag,BimapCore>::type
+ > type;
+};
+template< class Tag, class BimapCore >
+struct const_reverse_map_view_iterator :
+ public const_reverse_map_view_iterator_adaptor<Tag,BimapCore>::type
{
- typedef BOOST_DEDUCED_TYPENAME
- const_map_view_iterator_base<Tag,Relation,CoreIterator>::type base_;
-
+ typedef BOOST_DEDUCED_TYPENAME
+ const_reverse_map_view_iterator_adaptor<Tag,BimapCore>::type base_;
+
 public:

- const_map_view_iterator() {}
-
- const_map_view_iterator(CoreIterator const& iter)
+ const_reverse_map_view_iterator() {}
+ const_reverse_map_view_iterator(
+ BOOST_DEDUCED_TYPENAME base_::base_type const& iter)
 : base_(iter) {}
-
- const_map_view_iterator(const_map_view_iterator const & iter)
+ const_reverse_map_view_iterator(const_reverse_map_view_iterator const & iter)
 : base_(iter.base()) {}
-
- const_map_view_iterator(map_view_iterator<Tag,Relation,CoreIterator> i)
+ const_reverse_map_view_iterator(reverse_map_view_iterator<Tag,BimapCore> i)
 : base_(i.base()) {}

 BOOST_DEDUCED_TYPENAME base_::reference dereference() const
 {
 return ::boost::bimaps::relation::support::pair_by<Tag>(*this->base());
 }
-
 private:
-
 friend class iterator_core_access;
+ BOOST_BIMAP_MAP_VIEW_ITERATOR_SERIALIZATION_SUPPORT
+};

- #ifndef BOOST_BIMAP_DISABLE_SERIALIZATION

- // Serialization support
+// local_map_view_iterator

- BOOST_SERIALIZATION_SPLIT_MEMBER()
+template< class Tag, class BimapCore >
+struct local_map_view_iterator_adaptor {
+ typedef iterator_adaptor<
+ local_map_view_iterator<Tag,BimapCore>,
+ BOOST_DEDUCED_TYPENAME
+ local_core_iterator_type_by<Tag,BimapCore>::type,
+ BOOST_DEDUCED_TYPENAME
+ ::boost::bimaps::support::value_type_by<Tag,BimapCore>::type
+ > type;
+};
+template< class Tag, class BimapCore >
+struct local_map_view_iterator :
+ public local_map_view_iterator_adaptor<Tag,BimapCore>::type
+{
+ typedef BOOST_DEDUCED_TYPENAME
+ local_map_view_iterator_adaptor<Tag,BimapCore>::type base_;
+ public:

- friend class ::boost::serialization::access;
+ local_map_view_iterator() {}
+ local_map_view_iterator(
+ BOOST_DEDUCED_TYPENAME base_::base_type const& iter)
+ : base_(iter) {}
+ local_map_view_iterator(local_map_view_iterator const & iter)
+ : base_(iter.base()) {}

- template< class Archive >
- void save(Archive & ar, const unsigned int) const
+ BOOST_DEDUCED_TYPENAME base_::reference dereference() const
 {
- ar << ::boost::serialization::make_nvp("mi_iterator",this->base());
+ return ::boost::bimaps::relation::support::pair_by<Tag>(
+ *const_cast<BOOST_DEDUCED_TYPENAME base_::base_type::value_type*>(
+ &(*this->base())
+ )
+ );
 }
+ private:
+ friend class iterator_core_access;
+ BOOST_BIMAP_MAP_VIEW_ITERATOR_SERIALIZATION_SUPPORT
+};
+
+template< class Tag, class BimapCore >
+struct const_local_map_view_iterator_adaptor {
+ typedef iterator_adaptor<
+ const_local_map_view_iterator<Tag,BimapCore>,
+ BOOST_DEDUCED_TYPENAME
+ local_core_iterator_type_by<Tag,BimapCore>::type,
+ const BOOST_DEDUCED_TYPENAME
+ ::boost::bimaps::support::value_type_by<Tag,BimapCore>::type
+ > type;
+};
+template< class Tag, class BimapCore >
+struct const_local_map_view_iterator :
+ public const_local_map_view_iterator_adaptor<Tag,BimapCore>::type
+{
+ typedef BOOST_DEDUCED_TYPENAME
+ const_local_map_view_iterator_adaptor<Tag,BimapCore>::type base_;
+ public:
+
+ const_local_map_view_iterator() {}
+ const_local_map_view_iterator(
+ BOOST_DEDUCED_TYPENAME base_::base_type const& iter)
+ : base_(iter) {}
+ const_local_map_view_iterator(const_local_map_view_iterator const & iter)
+ : base_(iter.base()) {}
+ const_local_map_view_iterator(local_map_view_iterator<Tag,BimapCore> i)
+ : base_(i.base()) {}

- template< class Archive >
- void load(Archive & ar, const unsigned int)
+ BOOST_DEDUCED_TYPENAME base_::reference dereference() const
 {
- CoreIterator iter;
- ar >> ::boost::serialization::make_nvp("mi_iterator",iter);
- this->base_reference() = iter;
+ return ::boost::bimaps::relation::support::pair_by<Tag>(*this->base());
 }
-
- #endif // BOOST_BIMAP_DISABLE_SERIALIZATION
+ private:
+ friend class iterator_core_access;
+ BOOST_BIMAP_MAP_VIEW_ITERATOR_SERIALIZATION_SUPPORT
};

+#endif // BOOST_BIMAP_DOXYGEN_WILL_NOT_PROCESS_THE_FOLLOWING_LINES

} // namespace detail
} // namespace bimaps

Modified: branches/release/boost/bimap/detail/set_view_base.hpp
==============================================================================
--- branches/release/boost/bimap/detail/set_view_base.hpp (original)
+++ branches/release/boost/bimap/detail/set_view_base.hpp 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -199,7 +199,7 @@
 {
 return derived().base().replace(
 derived().template functor<iterator_to_base_>()(position),
- value_type_(l,position->right)
+ ::boost::bimaps::relation::detail::copy_with_left_replaced(*position,l)
 );
 }

@@ -209,7 +209,7 @@
 {
 return derived().base().replace(
 derived().template functor<iterator_to_base_>()(position),
- value_type_(position->left,r)
+ ::boost::bimaps::relation::detail::copy_with_right_replaced(*position,r)
 );
 }

Modified: branches/release/boost/bimap/relation/mutant_relation.hpp
==============================================================================
--- branches/release/boost/bimap/relation/mutant_relation.hpp (original)
+++ branches/release/boost/bimap/relation/mutant_relation.hpp 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -346,7 +346,7 @@
 {
 return ::boost::bimaps::relation::support::get<Tag>(*this);
 }
-
+
 #ifndef BOOST_BIMAP_DISABLE_SERIALIZATION

 private:
@@ -422,6 +422,50 @@
 (( a.left == b.left ) && ( a.right >= b.right )));
}

+namespace detail {
+
+template< class TA, class TB, class Info, bool force_mutable>
+mutant_relation<TA,TB,Info,force_mutable>
+ copy_with_left_replaced(mutant_relation<TA,TB,Info,force_mutable> const& rel,
+ BOOST_DEDUCED_TYPENAME ::boost::call_traits< BOOST_DEDUCED_TYPENAME
+ mutant_relation<TA,TB,Info,force_mutable>::left_value_type>
+ ::param_type l)
+{
+ return mutant_relation<TA,TB,Info,force_mutable>(l,rel.right,rel.info);
+}
+
+template< class TA, class TB, bool force_mutable>
+mutant_relation<TA,TB,::boost::mpl::na,force_mutable>
+ copy_with_left_replaced(mutant_relation<TA,TB,::boost::mpl::na,force_mutable> const& rel,
+ BOOST_DEDUCED_TYPENAME ::boost::call_traits< BOOST_DEDUCED_TYPENAME
+ mutant_relation<TA,TB,::boost::mpl::na,force_mutable>::left_value_type>
+ ::param_type l)
+{
+ return mutant_relation<TA,TB,::boost::mpl::na,force_mutable>(l,rel.right);
+}
+
+template< class TA, class TB, class Info, bool force_mutable>
+mutant_relation<TA,TB,Info,force_mutable>
+ copy_with_right_replaced(mutant_relation<TA,TB,Info,force_mutable> const& rel,
+ BOOST_DEDUCED_TYPENAME ::boost::call_traits< BOOST_DEDUCED_TYPENAME
+ mutant_relation<TA,TB,Info,force_mutable>::right_value_type>
+ ::param_type r)
+{
+ return mutant_relation<TA,TB,Info,force_mutable>(rel.left,r,rel.info);
+}
+
+template< class TA, class TB, bool force_mutable>
+mutant_relation<TA,TB,::boost::mpl::na,force_mutable>
+ copy_with_right_replaced(mutant_relation<TA,TB,::boost::mpl::na,force_mutable> const& rel,
+ BOOST_DEDUCED_TYPENAME ::boost::call_traits< BOOST_DEDUCED_TYPENAME
+ mutant_relation<TA,TB,::boost::mpl::na,force_mutable>::right_value_type>
+ ::param_type r)
+{
+ return mutant_relation<TA,TB,::boost::mpl::na,force_mutable>(rel.left,r);
+}
+
+} // namespace detail
+
} // namespace relation
} // namespace bimaps
} // namespace boost

Modified: branches/release/boost/bimap/relation/structured_pair.hpp
==============================================================================
--- branches/release/boost/bimap/relation/structured_pair.hpp (original)
+++ branches/release/boost/bimap/relation/structured_pair.hpp 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -499,6 +499,50 @@
}

+namespace detail {
+
+template< class FirstType, class SecondType, class Info, class Layout>
+structured_pair<FirstType,SecondType,Info,Layout>
+ copy_with_first_replaced(structured_pair<FirstType,SecondType,Info,Layout> const& p,
+ BOOST_DEDUCED_TYPENAME ::boost::call_traits< BOOST_DEDUCED_TYPENAME
+ structured_pair<FirstType,SecondType,Info,Layout>::first_type>
+ ::param_type f)
+{
+ return structured_pair<FirstType,SecondType,Info,Layout>(f,p.second,p.info);
+}
+
+template< class FirstType, class SecondType, class Layout>
+structured_pair<FirstType,SecondType,::boost::mpl::na,Layout>
+ copy_with_first_replaced(structured_pair<FirstType,SecondType,::boost::mpl::na,Layout> const& p,
+ BOOST_DEDUCED_TYPENAME ::boost::call_traits< BOOST_DEDUCED_TYPENAME
+ structured_pair<FirstType,SecondType,::boost::mpl::na,Layout>::first_type>
+ ::param_type f)
+{
+ return structured_pair<FirstType,SecondType,::boost::mpl::na,Layout>(f,p.second);
+}
+
+template< class FirstType, class SecondType, class Info, class Layout>
+structured_pair<FirstType,SecondType,Info,Layout>
+ copy_with_second_replaced(structured_pair<FirstType,SecondType,Info,Layout> const& p,
+ BOOST_DEDUCED_TYPENAME ::boost::call_traits< BOOST_DEDUCED_TYPENAME
+ structured_pair<FirstType,SecondType,Info,Layout>::second_type>
+ ::param_type s)
+{
+ return structured_pair<FirstType,SecondType,Info,Layout>(p.first,s,p.info);
+}
+
+template< class FirstType, class SecondType, class Layout>
+structured_pair<FirstType,SecondType,::boost::mpl::na,Layout>
+ copy_with_second_replaced(structured_pair<FirstType,SecondType,::boost::mpl::na,Layout> const& p,
+ BOOST_DEDUCED_TYPENAME ::boost::call_traits< BOOST_DEDUCED_TYPENAME
+ structured_pair<FirstType,SecondType,::boost::mpl::na,Layout>::second_type>
+ ::param_type s)
+{
+ return structured_pair<FirstType,SecondType,::boost::mpl::na,Layout>(p.first,s);
+}
+
+} // namespace detail
+

} // namespace relation
} // namespace bimaps

Modified: branches/release/boost/bimap/support/iterator_type_by.hpp
==============================================================================
--- branches/release/boost/bimap/support/iterator_type_by.hpp (original)
+++ branches/release/boost/bimap/support/iterator_type_by.hpp 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -21,14 +21,11 @@
#include <boost/bimap/relation/detail/metadata_access_builder.hpp>
#include <boost/bimap/relation/detail/static_access_builder.hpp>

-#include <boost/bimap/relation/support/pair_type_by.hpp>
-
-#include <boost/bimap/detail/map_view_iterator.hpp>
-
/** \struct boost::bimaps::support::iterator_type_by

\brief Metafunction to obtain the iterator type of the map view by one of the sides.
-
+These metafunctions can be used outside the bimap framework for other bimap
+signature compatible classes.
\code

template< class Tag, class Bimap >
@@ -79,7 +76,6 @@
namespace bimaps {
namespace support {

-
// Implementation of iterator type by metafunction

BOOST_BIMAP_SYMMETRIC_METADATA_ACCESS_BUILDER
@@ -101,123 +97,41 @@

// Implementation of reverse iterator type by metafunction

-BOOST_BIMAP_SYMMETRIC_STATIC_ACCESS_BUILDER
+BOOST_BIMAP_SYMMETRIC_METADATA_ACCESS_BUILDER
(
- core_reverse_iterator_type_by,
- BimapCore,
-
- typedef BOOST_DEDUCED_TYPENAME BimapCore::core_type::BOOST_NESTED_TEMPLATE
- index<BOOST_DEDUCED_TYPENAME BimapCore::left_tag>
- ::type::reverse_iterator type,
-
- typedef BOOST_DEDUCED_TYPENAME BimapCore::core_type::BOOST_NESTED_TEMPLATE
- index<BOOST_DEDUCED_TYPENAME BimapCore::right_tag>
- ::type::reverse_iterator type
+ reverse_iterator_type_by,
+ left_reverse_iterator,
+ right_reverse_iterator
)

-template< class Tag, class BimapCore >
-struct reverse_iterator_type_by
-{
- typedef ::boost::bimaps::detail::map_view_iterator
- <
- Tag,
- BOOST_DEDUCED_TYPENAME BimapCore::relation,
- BOOST_DEDUCED_TYPENAME core_reverse_iterator_type_by<Tag,BimapCore>::type
-
- > type;
-};
-
// Implementation of const reverse iterator type by metafunction

-BOOST_BIMAP_SYMMETRIC_STATIC_ACCESS_BUILDER
+BOOST_BIMAP_SYMMETRIC_METADATA_ACCESS_BUILDER
(
- core_const_reverse_iterator_type_by,
- BimapCore,
-
- typedef BOOST_DEDUCED_TYPENAME BimapCore::core_type::BOOST_NESTED_TEMPLATE
- index<BOOST_DEDUCED_TYPENAME BimapCore::left_tag>
- ::type::const_reverse_iterator type,
-
- typedef BOOST_DEDUCED_TYPENAME BimapCore::core_type::BOOST_NESTED_TEMPLATE
- index<BOOST_DEDUCED_TYPENAME BimapCore::right_tag>
- ::type::const_reverse_iterator type
+ const_reverse_iterator_type_by,
+ left_const_reverse_iterator,
+ right_const_reverse_iterator
)

-template< class Tag, class BimapCore >
-struct const_reverse_iterator_type_by
-{
-
- typedef ::boost::bimaps::detail::map_view_iterator
- <
- Tag,
- BOOST_DEDUCED_TYPENAME BimapCore::relation,
- BOOST_DEDUCED_TYPENAME core_const_reverse_iterator_type_by<Tag,BimapCore>::type
-
- > type;
-};
-

// Implementation of local iterator type by metafunction

-BOOST_BIMAP_SYMMETRIC_STATIC_ACCESS_BUILDER
+BOOST_BIMAP_SYMMETRIC_METADATA_ACCESS_BUILDER
(
- core_local_iterator_type_by,
- BimapCore,
-
- typedef BOOST_DEDUCED_TYPENAME BimapCore::core_type::BOOST_NESTED_TEMPLATE
- index<BOOST_DEDUCED_TYPENAME BimapCore::left_tag>
- ::type::local_iterator type,
-
- typedef BOOST_DEDUCED_TYPENAME BimapCore::core_type::BOOST_NESTED_TEMPLATE
- index<BOOST_DEDUCED_TYPENAME BimapCore::right_tag>
- ::type::local_iterator type
+ local_iterator_type_by,
+ left_local_iterator,
+ right_local_iterator
)

-
-template< class Tag, class BimapCore >
-struct local_iterator_type_by
-{
-
- typedef ::boost::bimaps::detail::map_view_iterator
- <
- Tag,
- BOOST_DEDUCED_TYPENAME BimapCore::relation,
- BOOST_DEDUCED_TYPENAME core_local_iterator_type_by<Tag,BimapCore>::type
-
- > type;
-};
-
-
// Implementation of const local iterator type by metafunction

-BOOST_BIMAP_SYMMETRIC_STATIC_ACCESS_BUILDER
+BOOST_BIMAP_SYMMETRIC_METADATA_ACCESS_BUILDER
(
- core_const_local_iterator_type_by,
- BimapCore,
-
- typedef BOOST_DEDUCED_TYPENAME BimapCore::core_type::BOOST_NESTED_TEMPLATE
- index<BOOST_DEDUCED_TYPENAME BimapCore::left_tag>
- ::type::const_local_iterator type,
-
- typedef BOOST_DEDUCED_TYPENAME BimapCore::core_type::BOOST_NESTED_TEMPLATE
- index<BOOST_DEDUCED_TYPENAME BimapCore::right_tag>
- ::type::const_local_iterator type
+ const_local_iterator_type_by,
+ left_const_local_iterator,
+ right_const_local_iterator
)

-template< class Tag, class BimapCore >
-struct const_local_iterator_type_by
-{
-
- typedef ::boost::bimaps::detail::map_view_iterator
- <
- Tag,
- BOOST_DEDUCED_TYPENAME BimapCore::relation,
- BOOST_DEDUCED_TYPENAME core_const_local_iterator_type_by<Tag,BimapCore>::type
-
- > type;
-};
-
-
} // namespace support
} // namespace bimaps
} // namespace boost

Modified: branches/release/boost/bimap/views/list_map_view.hpp
==============================================================================
--- branches/release/boost/bimap/views/list_map_view.hpp (original)
+++ branches/release/boost/bimap/views/list_map_view.hpp 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -36,22 +36,17 @@
{
 typedef ::boost::bimaps::container_adaptor::list_map_adaptor
 <
- BOOST_DEDUCED_TYPENAME BimapType::core_type::BOOST_NESTED_TEMPLATE index<Tag>::type,
- BOOST_DEDUCED_TYPENAME ::boost::bimaps::support::
- iterator_type_by<Tag,BimapType>::type,
- BOOST_DEDUCED_TYPENAME ::boost::bimaps::support::
- const_iterator_type_by<Tag,BimapType>::type,
- BOOST_DEDUCED_TYPENAME ::boost::bimaps::support::
- reverse_iterator_type_by<Tag,BimapType>::type,
- BOOST_DEDUCED_TYPENAME ::boost::bimaps::support::
- const_reverse_iterator_type_by<Tag,BimapType>::type,
+ BOOST_DEDUCED_TYPENAME BimapType::core_type::
+ BOOST_NESTED_TEMPLATE index<Tag>::type,
+ ::boost::bimaps::detail:: map_view_iterator<Tag,BimapType>,
+ ::boost::bimaps::detail:: const_map_view_iterator<Tag,BimapType>,
+ ::boost::bimaps::detail:: reverse_map_view_iterator<Tag,BimapType>,
+ ::boost::bimaps::detail::const_reverse_map_view_iterator<Tag,BimapType>,
 ::boost::bimaps::container_adaptor::support::iterator_facade_to_base
 <
- BOOST_DEDUCED_TYPENAME ::boost::bimaps::support::
- iterator_type_by<Tag,BimapType>::type,
- BOOST_DEDUCED_TYPENAME ::boost::bimaps::support::
- const_iterator_type_by<Tag,BimapType>::type
-
+ ::boost::bimaps::detail:: map_view_iterator<Tag,BimapType>,
+ ::boost::bimaps::detail::const_map_view_iterator<Tag,BimapType>
+
>,
 ::boost::mpl::na,
 ::boost::mpl::na,
@@ -64,7 +59,7 @@
 <
 Tag,
 BOOST_DEDUCED_TYPENAME BimapType::relation
-
+
>::type

> type;

Modified: branches/release/boost/bimap/views/map_view.hpp
==============================================================================
--- branches/release/boost/bimap/views/map_view.hpp (original)
+++ branches/release/boost/bimap/views/map_view.hpp 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -40,7 +40,7 @@
 public BOOST_BIMAP_MAP_VIEW_CONTAINER_ADAPTOR(
 map_adaptor,
 Tag,BimapType,
- reverse_iterator_type_by,const_reverse_iterator_type_by
+ reverse_map_view_iterator,const_reverse_map_view_iterator
 ),
 public ::boost::bimaps::detail::
 map_view_base< map_view<Tag,BimapType>,Tag,BimapType >,
@@ -50,7 +50,7 @@
 typedef BOOST_BIMAP_MAP_VIEW_CONTAINER_ADAPTOR(
 map_adaptor,
 Tag,BimapType,
- reverse_iterator_type_by,const_reverse_iterator_type_by
+ reverse_map_view_iterator,const_reverse_map_view_iterator

 ) base_;

Modified: branches/release/boost/bimap/views/multimap_view.hpp
==============================================================================
--- branches/release/boost/bimap/views/multimap_view.hpp (original)
+++ branches/release/boost/bimap/views/multimap_view.hpp 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -42,7 +42,7 @@
 public BOOST_BIMAP_MAP_VIEW_CONTAINER_ADAPTOR(
 multimap_adaptor,
 Tag,BimapType,
- reverse_iterator_type_by,const_reverse_iterator_type_by
+ reverse_map_view_iterator,const_reverse_map_view_iterator
 ),
 public ::boost::bimaps::detail::
 map_view_base< multimap_view<Tag,BimapType>,Tag,BimapType >
@@ -51,7 +51,7 @@
 typedef BOOST_BIMAP_MAP_VIEW_CONTAINER_ADAPTOR(
 multimap_adaptor,
 Tag,BimapType,
- reverse_iterator_type_by,const_reverse_iterator_type_by
+ reverse_map_view_iterator,const_reverse_map_view_iterator

 ) base_;

Modified: branches/release/boost/bimap/views/unconstrained_map_view.hpp
==============================================================================
--- branches/release/boost/bimap/views/unconstrained_map_view.hpp (original)
+++ branches/release/boost/bimap/views/unconstrained_map_view.hpp 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -31,6 +31,8 @@
 template< class T >
 unconstrained_map_view(const T &) {}

+ typedef void iterator;
+ typedef void const_iterator;
 typedef void reference;
 typedef void const_reference;
 typedef void info_type;

Modified: branches/release/boost/bimap/views/unordered_map_view.hpp
==============================================================================
--- branches/release/boost/bimap/views/unordered_map_view.hpp (original)
+++ branches/release/boost/bimap/views/unordered_map_view.hpp 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -43,7 +43,7 @@
 public BOOST_BIMAP_MAP_VIEW_CONTAINER_ADAPTOR(
 unordered_map_adaptor,
 Tag,BimapType,
- local_iterator_type_by,const_local_iterator_type_by
+ local_map_view_iterator,const_local_map_view_iterator
 ),

 public ::boost::bimaps::detail::map_view_base<
@@ -56,7 +56,7 @@
 typedef BOOST_BIMAP_MAP_VIEW_CONTAINER_ADAPTOR(
 unordered_map_adaptor,
 Tag,BimapType,
- local_iterator_type_by,const_local_iterator_type_by
+ local_map_view_iterator,const_local_map_view_iterator

 ) base_;

Modified: branches/release/boost/bimap/views/unordered_multimap_view.hpp
==============================================================================
--- branches/release/boost/bimap/views/unordered_multimap_view.hpp (original)
+++ branches/release/boost/bimap/views/unordered_multimap_view.hpp 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -44,7 +44,7 @@
 public BOOST_BIMAP_MAP_VIEW_CONTAINER_ADAPTOR(
 unordered_multimap_adaptor,
 Tag,BimapType,
- local_iterator_type_by,const_local_iterator_type_by
+ local_map_view_iterator,const_local_map_view_iterator
 ),

 public ::boost::bimaps::detail::map_view_base<
@@ -54,7 +54,7 @@
 typedef BOOST_BIMAP_MAP_VIEW_CONTAINER_ADAPTOR(
 unordered_multimap_adaptor,
 Tag,BimapType,
- local_iterator_type_by,const_local_iterator_type_by
+ local_map_view_iterator,const_local_map_view_iterator

 ) base_;

Modified: branches/release/boost/bimap/views/vector_map_view.hpp
==============================================================================
--- branches/release/boost/bimap/views/vector_map_view.hpp (original)
+++ branches/release/boost/bimap/views/vector_map_view.hpp 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -41,7 +41,7 @@
 public BOOST_BIMAP_MAP_VIEW_CONTAINER_ADAPTOR(
 vector_map_adaptor,
 Tag,BimapType,
- reverse_iterator_type_by, const_reverse_iterator_type_by
+ reverse_map_view_iterator, const_reverse_map_view_iterator
 ),

 public ::boost::bimaps::detail::
@@ -50,7 +50,7 @@
 typedef BOOST_BIMAP_MAP_VIEW_CONTAINER_ADAPTOR(
 vector_map_adaptor,
 Tag,BimapType,
- reverse_iterator_type_by, const_reverse_iterator_type_by
+ reverse_map_view_iterator, const_reverse_map_view_iterator

 ) base_;

@@ -75,7 +75,41 @@
 this->base() = v.base();
 return *this;
 }
+
+ BOOST_DEDUCED_TYPENAME base_::const_reference
+ operator[](BOOST_DEDUCED_TYPENAME base_::size_type n) const
+ {
+ return this->template functor<BOOST_DEDUCED_TYPENAME base_::value_from_base>()(
+ this->base().operator[](n)
+ );
+ }
+
+ BOOST_DEDUCED_TYPENAME base_::const_reference
+ at(BOOST_DEDUCED_TYPENAME base_::size_type n) const
+ {
+ return this->template functor<BOOST_DEDUCED_TYPENAME base_::value_from_base>()(
+ this->base().at(n)
+ );
+ }
+
+ BOOST_DEDUCED_TYPENAME base_::reference
+ operator[](BOOST_DEDUCED_TYPENAME base_::size_type n)
+ {
+ return this->template functor<BOOST_DEDUCED_TYPENAME base_::value_from_base>()(
+ const_cast<BOOST_DEDUCED_TYPENAME base_::base_type::value_type &>(
+ this->base().operator[](n)
+ ));
+ }

+ BOOST_DEDUCED_TYPENAME base_::reference
+ at(BOOST_DEDUCED_TYPENAME base_::size_type n)
+ {
+ return this->template functor<BOOST_DEDUCED_TYPENAME base_::value_from_base>()(
+ const_cast<BOOST_DEDUCED_TYPENAME base_::base_type::value_type &>(
+ this->base().at(n)
+ ));
+ }
+
 BOOST_BIMAP_VIEW_ASSIGN_IMPLEMENTATION(base_)

 BOOST_BIMAP_VIEW_FRONT_BACK_IMPLEMENTATION(base_)
@@ -273,7 +307,7 @@
/*===========================================================================*/
#define BOOST_BIMAP_MAP_VIEW_EXTRA_TYPEDEFS_BODY(MAP_VIEW,SIDE) \
 BOOST_BIMAP_MAP_VIEW_EXTRA_TYPEDEF(MAP_VIEW,SIDE,reverse_iterator) \
- BOOST_BIMAP_MAP_VIEW_EXTRA_TYPEDEF(MAP_VIEW,SIDE,const_reverse_iterator) \
+ BOOST_BIMAP_MAP_VIEW_EXTRA_TYPEDEF(MAP_VIEW,SIDE,const_reverse_iterator)
/*===========================================================================*/

namespace detail {

Modified: branches/release/boost/bimap/views/vector_set_view.hpp
==============================================================================
--- branches/release/boost/bimap/views/vector_set_view.hpp (original)
+++ branches/release/boost/bimap/views/vector_set_view.hpp 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -68,6 +68,40 @@
 return *this;
 }

+ BOOST_DEDUCED_TYPENAME base_::const_reference
+ operator[](BOOST_DEDUCED_TYPENAME base_::size_type n) const
+ {
+ return this->template functor<BOOST_DEDUCED_TYPENAME base_::value_from_base>()(
+ this->base().operator[](n)
+ );
+ }
+
+ BOOST_DEDUCED_TYPENAME base_::const_reference
+ at(BOOST_DEDUCED_TYPENAME base_::size_type n) const
+ {
+ return this->template functor<BOOST_DEDUCED_TYPENAME base_::value_from_base>()(
+ this->base().at(n)
+ );
+ }
+
+ BOOST_DEDUCED_TYPENAME base_::reference
+ operator[](BOOST_DEDUCED_TYPENAME base_::size_type n)
+ {
+ return this->template functor<BOOST_DEDUCED_TYPENAME base_::value_from_base>()(
+ const_cast<BOOST_DEDUCED_TYPENAME base_::base_type::value_type &>(
+ this->base().operator[](n)
+ ));
+ }
+
+ BOOST_DEDUCED_TYPENAME base_::reference
+ at(BOOST_DEDUCED_TYPENAME base_::size_type n)
+ {
+ return this->template functor<BOOST_DEDUCED_TYPENAME base_::value_from_base>()(
+ const_cast<BOOST_DEDUCED_TYPENAME base_::base_type::value_type &>(
+ this->base().at(n)
+ ));
+ }
+
 BOOST_BIMAP_VIEW_ASSIGN_IMPLEMENTATION(base_)

 BOOST_BIMAP_VIEW_FRONT_BACK_IMPLEMENTATION(base_)

Modified: branches/release/libs/bimap/doc/bimap.qbk
==============================================================================
--- branches/release/libs/bimap/doc/bimap.qbk (original)
+++ branches/release/libs/bimap/doc/bimap.qbk 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -1,7 +1,7 @@
[library Boost.Bimap
     [quickbook 1.4]
     [authors [Capeletto, Matias]]
- [copyright 2006-2007 Matias Capeletto]
+ [copyright 2006-2012 Matias Capeletto]
     [category container]
     [id bimap]
     [dirname bimap]

Modified: branches/release/libs/bimap/doc/html/boost_bimap/acknowledgements.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/acknowledgements.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/acknowledgements.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -21,7 +21,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_acknowledgements">
<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>
@@ -70,9 +70,10 @@
 formal review and give me useful advices to improve this library. And thanks
 a lot to Ion Gaztañaga for managing the review.
 
-<a name="boost_bimap.acknowledgements.boost_bimap_team"></a><h4>
-<a name="id889228"></a>
- <a class="link" href="acknowledgements.html#boost_bimap.acknowledgements.boost_bimap_team">Boost.Bimap Team</a>
+<h4>
+<a name="boost_bimap.acknowledgements.h0"></a>
+ <a name="boost_bimap.acknowledgements.boost_bimap_team"></a><a class="link" href="acknowledgements.html#boost_bimap.acknowledgements.boost_bimap_team">Boost.Bimap
+ Team</a>
 </h4>

 From Argentina... Matias and Mafalda and from Spain... Joaquin and Hector
@@ -86,7 +87,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/bimap_and_boost.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/bimap_and_boost.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/bimap_and_boost.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_bimap_and_boost">
<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">
+<div class="section boost_bimap_bimap_and_boost_bimap_and_multiindex">
<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>
@@ -82,7 +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="id797996" href="#ftn.id797996" class="footnote">2</a>]. There is no learning curve if you know how to use standard containers.
+ maps [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 +126,8 @@
 
</div>
<div class="footnotes">
- <hr width="100" align="left">
-<div class="footnote">[<a id="ftn.id797996" href="#id797996" class="para">2</a>] 
+ <hr style="width:100; align:left;">
+<div id="ftn.boost_bimap.bimap_and_boost.bimap_and_multiindex.f0" class="footnote">^[2]
 In the same fashion, Boost.MRU will allow the creation of most
 recent updated aware containers, hiding the complexity of Boost.MultiIndex.
 </div>
@@ -135,7 +135,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_bimap_and_boost_boost_libraries_that_work_well_with_boost_bimap">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap"></a><a 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">
+<div class="section boost_bimap_bimap_and_boost_boost_libraries_that_work_well_with_boost_bimap_introduction">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.introduction"></a><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>
@@ -280,7 +280,7 @@
</tbody>
</table></div>
</div>
-<div class="section">
+<div class="section boost_bimap_bimap_and_boost_boost_libraries_that_work_well_with_boost_bimap_boost_serialization">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_serialization"></a><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,12 +294,11 @@
 code</a>
 

-

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

-// Create a bimap and serialize it to a file
-{
+// Create a bimap and serialize it to a file
+{
 bm_type bm;
 bm.insert( bm_type::value_type("one",1) );
 bm.insert( bm_type::value_type("two",2) );
@@ -307,17 +306,17 @@
 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_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_serialization.c0" 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.c1"><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_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_serialization.c2" 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.c3"><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);
 oa << right_iter;
}

-// Load the bimap back
-{
+// Load the bimap back
+{
 bm_type bm;

 std::ifstream ifs("data", std::ios::binary);
@@ -342,7 +341,7 @@
 
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
-<td width="5%" valign="top" align="left"><a name="boost_bimap16"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_serialization.c1"></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
@@ -350,7 +349,7 @@
 </td>
</tr>
<tr>
-<td width="5%" valign="top" align="left"><a name="boost_bimap17"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_serialization.c3"></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
@@ -396,7 +395,7 @@
 must be done only after serializing its corresponding container.
 
</div>
-<div class="section">
+<div class="section boost_bimap_bimap_and_boost_boost_libraries_that_work_well_with_boost_bimap_boost_assign">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_assign"></a><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>
@@ -422,27 +421,26 @@
 <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>
+ // We can use assign::list_of to initialize the container.
+
+ bm_type bm = assign::list_of< bm_type::relation > <a class="co" name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_assign.c0" 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.c1"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>
 ( 1, "one" )
 ( 2, "two" )
 ( 3, "three" );

- // The left map view is a multiset, again we use insert
-
+ // The left map view is a multiset, again we use insert
+
 assign::insert( bm.left )
 ( 4, "four" )
 ( 5, "five" )
 ( 6, "six" );

- // The right map view is a list so we use push_back here
- // Note the order of the elements in the list!
-
+ // The right map view is a list so we use push_back here
+ // Note the order of the elements in the list!
+
 assign::push_back( bm.right )
 ( "seven" , 7 )
 ( "eight" , 8 );
@@ -452,16 +450,16 @@
 ( "ten" , 10 )
 ( "eleven", 11 );

-// Since it is left_based the main view is a multiset, so we use insert
-
+// Since it is left_based the main view is a multiset, so we use insert
+
 assign::insert( bm )
 ( 12, "twelve" )
 ( 13, "thirteen" );
- </pre>
+</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 width="5%" valign="top" align="left"><a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_assign.c1"></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>
@@ -469,7 +467,7 @@
 </td>
</tr></table></div>
</div>
-<div class="section">
+<div class="section boost_bimap_bimap_and_boost_boost_libraries_that_work_well_with_boost_bimap_boost_hash">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_hash"></a><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>
@@ -495,7 +493,7 @@
 the unordered set types with any user types.
 
</div>
-<div class="section">
+<div class="section boost_bimap_bimap_and_boost_boost_libraries_that_work_well_with_boost_bimap_boost_lambda">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_lambda"></a><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>
@@ -517,7 +515,6 @@
 <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;

@@ -534,7 +531,7 @@

 
</div>
-<div class="section">
+<div class="section boost_bimap_bimap_and_boost_boost_libraries_that_work_well_with_boost_bimap_boost_range">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_range"></a><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>
@@ -558,12 +555,11 @@
 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)
{
- typedef typename
+ typedef typename
 boost::range_const_iterator<ForwardReadableRange>::type const_iterator;

 for(const_iterator i= boost::begin(r), iend= boost::end(r); i!=iend; ++i )
@@ -598,7 +594,6 @@
 function.
 

-

<pre class="programlisting">struct pair_printer
{
@@ -628,21 +623,21 @@
 bm_type bm;
 bm.insert( bm_type::value_type(2.5 , 1) );
 bm.insert( bm_type::value_type(3.1 , 2) );
- //...
- bm.insert( bm_type::value_type(6.4 , 4) );
+ //...
+ bm.insert( bm_type::value_type(6.4 , 4) );
 bm.insert( bm_type::value_type(1.7 , 2) );

- // Print all the elements of the left map view
-
+ // Print all the elements of the left map view
+
 for_each( bm.left, pair_printer(std::cout) );

- // Print a range of elements of the right map view
-
+ // Print a range of elements of the right map view
+
 for_each( bm.right.range( 2 <= _key, _key < 6 ), pair_printer(std::cout) );

- // Count the number of elements where the data is equal to 2 from a
- // range of elements of the left map view
-
+ // Count the number of elements where the data is equal to 2 from a
+ // range of elements of the left map view
+
 count_if( bm.left.range( 2.3 < _key, _key < 5.4 ),
 bind<int>( second_extractor(), _1 ) == 2 );

@@ -655,7 +650,7 @@
 <a href="../../../../example/bimap_and_boost/range.cpp" target="_top">Go to source code</a>
 
</div>
-<div class="section">
+<div class="section boost_bimap_bimap_and_boost_boost_libraries_that_work_well_with_boost_bimap_boost_foreach">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_foreach"></a><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>
@@ -675,7 +670,6 @@
 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;

@@ -687,19 +681,18 @@

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_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_foreach.c0" 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.c1"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>
}

BOOST_FOREACH( bm_type::right_const_reference p, bm.right )
{
 std::cout << p.first << "-->" << p.second << std::endl;
}
-
</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 width="5%" valign="top" align="left"><a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_foreach.c1"></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.
@@ -709,7 +702,6 @@
 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") ) ))
@@ -729,7 +721,7 @@
 <a href="../../../../example/bimap_and_boost/foreach.cpp" target="_top">Go to source code</a>
 
</div>
-<div class="section">
+<div class="section boost_bimap_bimap_and_boost_boost_libraries_that_work_well_with_boost_bimap_boost_typeof">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_typeof"></a><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>
@@ -751,7 +743,6 @@
 If we have
 

-

<pre class="programlisting">typedef bimap< tagged<std::string,name>, tagged<int,number> > bm_type;
bm_type bm;
@@ -764,7 +755,6 @@
 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)
@@ -781,7 +771,6 @@
 can be rewrited as
 

-

<pre class="programlisting">for( BOOST_AUTO(iter, bm.by<name>().begin()); iter!=bm.by<name>().end(); ++iter)
{
@@ -797,7 +786,7 @@
 <a href="../../../../example/bimap_and_boost/typeof.cpp" target="_top">Go to source code</a>
 
</div>
-<div class="section">
+<div class="section boost_bimap_bimap_and_boost_boost_libraries_that_work_well_with_boost_bimap_boost_xpressive">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_xpressive"></a><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>
@@ -807,7 +796,6 @@
 Here is an example (it is just beatifull)
 

-

<pre class="programlisting">typedef bimap< std::string, int > bm_type;
bm_type bm;
@@ -831,7 +819,7 @@
 <a href="../../../../example/bimap_and_boost/xpressive.cpp" target="_top">Go to source code</a>
 
</div>
-<div class="section">
+<div class="section boost_bimap_bimap_and_boost_boost_libraries_that_work_well_with_boost_bimap_boost_property_map">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_property_map"></a><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>
@@ -870,7 +858,6 @@
 code</a>
 

-

<pre class="programlisting">template <typename AddressMap>
void foo(AddressMap & address_map)
@@ -903,7 +890,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/bimap_and_boost/dependencies.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/bimap_and_boost/dependencies.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/bimap_and_boost/dependencies.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_bimap_and_boost_dependencies">
<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="id806919"></a>Table 1.4. Boost Libraries needed by Boost.Bimap
+<a name="boost_bimap.bimap_and_boost.dependencies.t0"></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>
@@ -184,7 +184,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id807212"></a>Table 1.5. Optional Boost Libraries
+<a name="boost_bimap.bimap_and_boost.dependencies.t1"></a>Table 1.5. Optional Boost Libraries
<div class="table-contents"><table class="table" summary="Optional Boost Libraries">
<colgroup>
<col>
@@ -355,7 +355,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id807521"></a>Table 1.6. Additional Boost Libraries needed to run the test-suite
+<a name="boost_bimap.bimap_and_boost.dependencies.t2"></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>
@@ -403,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/compiler_specifics.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/compiler_specifics.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/compiler_specifics.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_compiler_specifics">
<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>
@@ -324,18 +324,20 @@
</tr>
</tbody>
</table></div>
-<a name="boost_bimap.compiler_specifics.vs_7_1"></a><h3>
-<a name="id866952"></a>
- <a class="link" href="compiler_specifics.html#boost_bimap.compiler_specifics.vs_7_1">VS 7.1</a>
+<h3>
+<a name="boost_bimap.compiler_specifics.h0"></a>
+ <a name="boost_bimap.compiler_specifics.vs_7_1"></a><a class="link" href="compiler_specifics.html#boost_bimap.compiler_specifics.vs_7_1">VS
+ 7.1</a>
 </h3>

 If a .cpp file uses more than four differents bimaps the compiler will run
 out of symbols and issue an internal compiler error. The official solution
 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="id866980"></a>
- <a class="link" href="compiler_specifics.html#boost_bimap.compiler_specifics.vs_8_0">VS 8.0</a>
+<h3>
+<a name="boost_bimap.compiler_specifics.h1"></a>
+ <a name="boost_bimap.compiler_specifics.vs_8_0"></a><a class="link" href="compiler_specifics.html#boost_bimap.compiler_specifics.vs_8_0">VS
+ 8.0</a>
 </h3>

 VC++ 8.0 warns on usage of certain Standard Library and API functions that
@@ -352,7 +354,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/examples.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/examples.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/examples.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_examples">
<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">
+<div class="section boost_bimap_examples_examples_list">
<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="id867089"></a>Table 1.7. Tutorial examples
+<a name="boost_bimap.examples.examples_list.t0"></a>Table 1.7. Tutorial examples
<div class="table-contents"><table class="table" summary="Tutorial examples">
<colgroup>
<col>
@@ -239,7 +239,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id867580"></a>Table 1.8. Bimap and Boost examples
+<a name="boost_bimap.examples.examples_list.t1"></a>Table 1.8. Bimap and Boost examples
<div class="table-contents"><table class="table" summary="Bimap and Boost examples">
<colgroup>
<col>
@@ -366,7 +366,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id867811"></a>Table 1.9. Boost.MultiIndex to Boost.Bimap path examples
+<a name="boost_bimap.examples.examples_list.t2"></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>
@@ -432,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/examples/mighty_bimap.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/examples/mighty_bimap.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/examples/mighty_bimap.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_examples_mighty_bimap">
<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,7 +34,6 @@
 <a href="../../../../example/mighty_bimap.cpp" target="_top">Go to source code</a>
 

-

<pre class="programlisting">#include <iostream>
#include <string>
@@ -59,9 +58,9 @@

 translator trans;

- // We have to use `push_back` because the collection of relations is
- // a `list_of_relation`
-
+ // We have to use `push_back` because the collection of relations is
+ // a `list_of_relation`
+
 trans.push_back( translator::value_type("hola" ,"hello" ) );
 trans.push_back( translator::value_type("adios" ,"goodbye" ) );
 trans.push_back( translator::value_type("rosa" ,"rose" ) );
@@ -71,8 +70,8 @@
 std::string word;
 std::getline(std::cin,word);

- // Search the queried word on the from index (Spanish)
-
+ // Search the queried word on the from index (Spanish)
+
 translator::map_by<spanish>::const_iterator is
 = trans.by<spanish>().find(word);

@@ -84,8 +83,8 @@
 }
 else
 {
- // Word not found in Spanish, try our luck in English
-
+ // Word not found in Spanish, try our luck in English
+
 translator::map_by<english>::const_iterator ie
 = trans.by<english>().find(word);

@@ -97,8 +96,8 @@
 }
 else
 {
- // Word not found, show the possible translations
-
+ // Word not found, show the possible translations
+
 std::cout << "No such word in the dictionary" << std::endl;
 std::cout << "These are the possible translations" << std::endl;

@@ -123,7 +122,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___bidirectional_map.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___bidirectional_map.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___bidirectional_map.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_examples_multiindex_to_bimap_path___bidirectional_map">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.examples.multiindex_to_bimap_path___bidirectional_map"></a><a class="link" href="multiindex_to_bimap_path___bidirectional_map.html" title="MultiIndex to Bimap Path - Bidirectional Map">MultiIndex
 to Bimap Path - Bidirectional Map</a>
@@ -41,16 +41,15 @@
 query of words in both languages.
 
</div>
-<a name="boost_bimap.examples.multiindex_to_bimap_path___bidirectional_map.boost_multiindex"></a><h5>
-<a name="id872643"></a>
- <a class="link" href="multiindex_to_bimap_path___bidirectional_map.html#boost_bimap.examples.multiindex_to_bimap_path___bidirectional_map.boost_multiindex">Boost.MultiIndex</a>
+<h5>
+<a name="boost_bimap.examples.multiindex_to_bimap_path___bidirectional_map.h0"></a>
+ <a name="boost_bimap.examples.multiindex_to_bimap_path___bidirectional_map.boost_multiindex"></a><a class="link" href="multiindex_to_bimap_path___bidirectional_map.html#boost_bimap.examples.multiindex_to_bimap_path___bidirectional_map.boost_multiindex">Boost.MultiIndex</a>
 </h5>

 <a href="../../../../example/mi_to_b_path/mi_bidirectional_map.cpp" target="_top">Go to source
 code</a>
 

-

<pre class="programlisting">#include <iostream>
#include <boost/tokenizer.hpp>
@@ -62,14 +61,14 @@
using namespace boost;
using namespace boost::multi_index;

-// tags for accessing both sides of a bidirectional map
-
+// tags for accessing both sides of a bidirectional map
+
struct from {};
struct to {};

-// The class template bidirectional_map wraps the specification
-// of a bidirectional map based on multi_index_container.
-
+// The class template bidirectional_map wraps the specification
+// of a bidirectional map based on multi_index_container.
+
template<typename FromType,typename ToType>
struct bidirectional_map
{
@@ -93,17 +92,17 @@

};

-// A dictionary is a bidirectional map from strings to strings
-
+// A dictionary is a bidirectional map from strings to strings
+
typedef bidirectional_map<std::string,std::string>::type dictionary;

int main()
{
 dictionary d;

- // Fill up our microdictionary.
- // first members Spanish, second members English.
-
+ // Fill up our microdictionary.
+ // first members Spanish, second members English.
+
 d.insert(dictionary::value_type("hola","hello"));
 d.insert(dictionary::value_type("adios","goodbye"));
 d.insert(dictionary::value_type("rosa","rose"));
@@ -113,21 +112,21 @@
 std::string word;
 std::getline(std::cin,word);

- // search the queried word on the from index (Spanish)
-
+ // search the queried word on the from index (Spanish)
+
 dictionary::iterator it = d.get<from>().find(word);

 if( it != d.end() )
 {
- // the second part of the element is the equivalent in English
-
+ // the second part of the element is the equivalent in English
+
 std::cout << word << " is said "
 << it->second << " in English" << std::endl;
 }
 else
 {
- // word not found in Spanish, try our luck in English
-
+ // word not found in Spanish, try our luck in English
+
 dictionary::index_iterator<to>::type it2 = d.get<to>().find(word);
 if( it2 != d.get<to>().end() )
 {
@@ -145,16 +144,15 @@
</pre>

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

 <a href="../../../../example/mi_to_b_path/bidirectional_map.cpp" target="_top">Go to source
 code</a>
 

-

<pre class="programlisting">#include <iostream>
#include <boost/tokenizer.hpp>
@@ -162,8 +160,8 @@

using namespace boost::bimaps;

-// A dictionary is a bidirectional map from strings to strings
-
+// A dictionary is a bidirectional map from strings to strings
+
typedef bimap<std::string,std::string> dictionary;
typedef dictionary::value_type translation;

@@ -171,9 +169,9 @@
{
 dictionary d;

- // Fill up our microdictionary.
- // first members Spanish, second members English.
-
+ // Fill up our microdictionary.
+ // first members Spanish, second members English.
+
 d.insert( translation("hola" ,"hello" ));
 d.insert( translation("adios","goodbye"));
 d.insert( translation("rosa" ,"rose" ));
@@ -183,27 +181,27 @@
 std::string word;
 std::getline(std::cin,word);

- // search the queried word on the from index (Spanish)
-
+ // search the queried word on the from index (Spanish)
+
 dictionary::left_const_iterator it = d.left.find(word);

 if( it != d.left.end() )
 {
- // the second part of the element is the equivalent in English
-
+ // 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_bimap.examples.multiindex_to_bimap_path___bidirectional_map.c0" href="multiindex_to_bimap_path___bidirectional_map.html#boost_bimap.examples.multiindex_to_bimap_path___bidirectional_map.c1"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>
 << " in English" << std::endl;
 }
 else
 {
- // word not found in Spanish, try our luck in English
-
+ // word not found in Spanish, try our luck in English
+
 dictionary::right_const_iterator it2 = d.right.find(word);
 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_bimap.examples.multiindex_to_bimap_path___bidirectional_map.c2" href="multiindex_to_bimap_path___bidirectional_map.html#boost_bimap.examples.multiindex_to_bimap_path___bidirectional_map.c3"><img src="../../../../../../doc/src/images/callouts/2.png" alt="2" border="0"></a>
 << " in Spanish" << std::endl;
 }
 else
@@ -219,7 +217,7 @@
 
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
-<td width="5%" valign="top" align="left"><a name="boost_bimap23"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap.examples.multiindex_to_bimap_path___bidirectional_map.c1"></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>
@@ -227,7 +225,7 @@
 </td>
</tr>
<tr>
-<td width="5%" valign="top" align="left"><a name="boost_bimap24"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap.examples.multiindex_to_bimap_path___bidirectional_map.c3"></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>
@@ -243,7 +241,6 @@
 source code</a>
 

-

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

@@ -251,13 +248,13 @@

using namespace boost::bimaps;

-// tags
-
+// tags
+
struct spanish {};
struct english {};

-// A dictionary is a bidirectional map from strings to strings
-
+// A dictionary is a bidirectional map from strings to strings
+
typedef bimap
<
 tagged< std::string,spanish >, tagged< std::string,english >
@@ -270,9 +267,9 @@
{
 dictionary d;

- // Fill up our microdictionary.
- // first members Spanish, second members English.
-
+ // Fill up our microdictionary. 
+ // first members Spanish, second members English.
+
 d.insert( translation("hola" ,"hello" ));
 d.insert( translation("adios","goodbye"));
 d.insert( translation("rosa" ,"rose" ));
@@ -282,20 +279,20 @@
 std::string word;
 std::getline(std::cin,word);

- // search the queried word on the from index (Spanish) */
-
+ // search the queried word on the from index (Spanish) */
+
 dictionary::map_by<spanish>::const_iterator it =
 d.by<spanish>().find(word);

 if( it != d.by<spanish>().end() )
 {
- std::cout << word << " is said "
+ std::cout << word << " is said "
 << it->get<english>() << " in English" << std::endl;
 }
 else
 {
- // word not found in Spanish, try our luck in English
-
+ // word not found in Spanish, try our luck in English
+
 dictionary::map_by<english>::const_iterator it2 =
 d.by<english>().find(word);

@@ -318,7 +315,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___hashed_indices.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___hashed_indices.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___hashed_indices.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_examples_multiindex_to_bimap_path___hashed_indices">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.examples.multiindex_to_bimap_path___hashed_indices"></a><a class="link" href="multiindex_to_bimap_path___hashed_indices.html" title="MultiIndex to Bimap Path - Hashed indices">MultiIndex
 to Bimap Path - Hashed indices</a>
@@ -39,16 +39,15 @@
 hashed index.
 
</div>
-<a name="boost_bimap.examples.multiindex_to_bimap_path___hashed_indices.boost_multiindex"></a><h5>
-<a name="id877266"></a>
- <a class="link" href="multiindex_to_bimap_path___hashed_indices.html#boost_bimap.examples.multiindex_to_bimap_path___hashed_indices.boost_multiindex">Boost.MultiIndex</a>
+<h5>
+<a name="boost_bimap.examples.multiindex_to_bimap_path___hashed_indices.h0"></a>
+ <a name="boost_bimap.examples.multiindex_to_bimap_path___hashed_indices.boost_multiindex"></a><a class="link" href="multiindex_to_bimap_path___hashed_indices.html#boost_bimap.examples.multiindex_to_bimap_path___hashed_indices.boost_multiindex">Boost.MultiIndex</a>
 </h5>

 <a href="../../../../example/mi_to_b_path/mi_hashed_indices.cpp" target="_top">Go to source
 code</a>
 

-

<pre class="programlisting">#include <iostream>
#include <iomanip>
@@ -64,9 +63,9 @@
using namespace boost::multi_index;
namespace bl = boost::lambda;

-// word_counter keeps the ocurrences of words inserted. A hashed
-// index allows for fast checking of preexisting entries.
-
+// word_counter keeps the ocurrences of words inserted. A hashed
+// index allows for fast checking of preexisting entries.
+
struct word_counter_entry
{
 std::string word;
@@ -103,8 +102,8 @@
 "...snip..."
 "...no se salga un punto de la verdad.";

- // feed the text into the container
-
+ // feed the text into the container
+
 word_counter wc;
 text_tokenizer tok(text,boost::char_separator<char>(" \t\n.,;:!?'\"-"));
 unsigned int total_occurrences = 0;
@@ -117,8 +116,8 @@
 wc.modify_key( wit, ++ bl::_1 );
 }

- // list words by frequency of appearance
-
+ // list words by frequency of appearance
+
 std::cout << std::fixed << std::setprecision(2);

 for( word_counter::iterator wit = wc.begin(), wit_end=wc.end();
@@ -135,15 +134,14 @@
</pre>

 
-<a name="boost_bimap.examples.multiindex_to_bimap_path___hashed_indices.boost_bimap"></a><h5>
-<a name="id878963"></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 name="boost_bimap.examples.multiindex_to_bimap_path___hashed_indices.h1"></a>
+ <a name="boost_bimap.examples.multiindex_to_bimap_path___hashed_indices.boost_bimap"></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>
@@ -162,8 +160,8 @@

typedef bimap
<
-
- multiset_of< tagged<unsigned int,occurrences>, std::greater<unsigned int> >,
+
+ multiset_of< tagged<unsigned int,occurrences>, std::greater<unsigned int> >,
unordered_set_of< tagged< std::string, word> >

> word_counter;
@@ -181,8 +179,8 @@
 "holds. This is useful in a lot of situations, but there are some "
 "relationships that are bidirectional by nature.";

- // feed the text into the container
-
+ // feed the text into the container
+
 word_counter wc;
 text_tokenizer tok(text,boost::char_separator<char>(" \t\n.,;:!?'\"-"));
 unsigned int total_occurrences = 0;
@@ -200,8 +198,8 @@
 wc.by<occurrences>().modify_key( wit, ++_key);
 }

- // list words by frequency of appearance
-
+ // list words by frequency of appearance
+
 std::cout << std::fixed << std::setprecision(2);

 for( word_counter::map_by<occurrences>::const_iterator
@@ -224,7 +222,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/examples/simple_bimap.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/examples/simple_bimap.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/examples/simple_bimap.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_examples_simple_bimap">
<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,7 +33,6 @@
 <a href="../../../../example/simple_bimap.cpp" target="_top">Go to source code</a>
 

-

<pre class="programlisting">#include <string>
#include <iostream>
@@ -55,8 +54,8 @@

int main()
{
- // Soccer World cup
-
+ // Soccer World cup
+
 typedef boost::bimap< std::string, int > results_bimap;
 typedef results_bimap::value_type position;

@@ -76,8 +75,8 @@
 std::cout << "Countries names ordered by their final position:"
 << std::endl;

- // results.right works like a std::map< int, std::string >
-
+ // results.right works like a std::map< int, std::string >
+
 print_map( results.right, ") ", std::cout );

 std::cout << std::endl
@@ -85,8 +84,8 @@
 "their final position:"
 << std::endl;

- // results.left works like a std::map< std::string, int >
-
+ // results.left works like a std::map< std::string, int >
+
 print_map( results.left, " ends in position ", std::cout );

 return 0;
@@ -101,7 +100,6 @@
 <a href="../../../../example/tagged_simple_bimap.cpp" target="_top">Go to source code</a>
 

-

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

@@ -114,8 +112,8 @@
{
 using namespace boost::bimaps;

- // Soccer World cup.
-
+ // Soccer World cup.
+
 typedef bimap
 <
 tagged< std::string, country >,
@@ -134,12 +132,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_bimap.examples.simple_bimap.c0" href="simple_bimap.html#boost_bimap.examples.simple_bimap.c1"><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_bimap.examples.simple_bimap.c2" href="simple_bimap.html#boost_bimap.examples.simple_bimap.c3"><img src="../../../../../../doc/src/images/callouts/2.png" alt="2" border="0"></a>std::cout << i->get<place >() << ") "
 << i->get<country>() << std::endl;
 }

@@ -148,7 +146,7 @@
 "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_bimap.examples.simple_bimap.c4" href="simple_bimap.html#boost_bimap.examples.simple_bimap.c5"><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 )
@@ -165,21 +163,21 @@
 
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
-<td width="5%" valign="top" align="left"><a name="boost_bimap20"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap.examples.simple_bimap.c1"></a> </td>
<td valign="top" align="left">
 <code class="computeroutput">results.by<place>()</code>
 is equivalent to <code class="computeroutput">results.right</code>
 </td>
</tr>
<tr>
-<td width="5%" valign="top" align="left"><a name="boost_bimap21"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap.examples.simple_bimap.c3"></a> </td>
<td valign="top" align="left">
 <code class="computeroutput">get<Tag></code>
 works for each view of the bimap
 </td>
</tr>
<tr>
-<td width="5%" valign="top" align="left"><a name="boost_bimap22"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap.examples.simple_bimap.c5"></a> </td>
<td valign="top" align="left">
 <code class="computeroutput">results.by<country>()</code>
 is equivalent to <code class="computeroutput">results.left</code>
@@ -189,7 +187,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/future_work.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/future_work.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/future_work.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,13 +22,14 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_future_work">
<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="id881474"></a>
- <a class="link" href="future_work.html#boost_bimap.future_work.rearrange_function">Rearrange Function</a>
+<h4>
+<a name="boost_bimap.future_work.h0"></a>
+ <a name="boost_bimap.future_work.rearrange_function"></a><a class="link" href="future_work.html#boost_bimap.future_work.rearrange_function">Rearrange
+ Function</a>
 </h4>

 Boost.MultiIndex includes some others functions that can be included in the
@@ -37,7 +38,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/history.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/history.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/history.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_history">
<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,14 +32,14 @@
<dt><a href="history/multiindex_and_bimap.html">MultiIndex
 and Bimap</a></dt>
</dl></div>
-<div class="section">
+<div class="section boost_bimap_history_the_long_path_from_code_project_to_boost">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.history.the_long_path_from_code_project_to_boost"></a><a class="link" href="history.html#boost_bimap.history.the_long_path_from_code_project_to_boost" title="The long path from Code Project to Boost">The
 long path from Code Project to Boost</a>
</h3></div></div></div>
<div class="variablelist">

-<dl>
+<dl class="variablelist">
<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
@@ -97,7 +97,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/history/multiindex_and_bimap.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/history/multiindex_and_bimap.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/history/multiindex_and_bimap.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_history_multiindex_and_bimap">
<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>
@@ -69,10 +69,9 @@
 your property tree: 
 </blockquote></div>

-

-<pre class="programlisting">// Data structure itself
-template<typename ValueType,typename KeyType>
+<pre class="programlisting">// Data structure itself
+template<typename ValueType,typename KeyType>
struct Node;
template<typename ValueType,typename KeyType>
struct ptree_gen {
@@ -84,16 +83,16 @@
 ValueType v;
 ptree_gen<ValueType,KeyType>::type children;
};
-// serialization support
-template<class Archive,typename ValueType,typename KeyType>
+// serialization support
+template<class Archive,typename ValueType,typename KeyType>
void serialize(Archive & ar, Node<ValueType,KeyType>& n,
 const unsigned int version)
{
 ar & n.v;
 ar & n.children;
}
-// some access methods
-template<typename ValueType,typename KeyType>
+// some access methods
+template<typename ValueType,typename KeyType>
ValueType const&
get( string const& keys, ptree_gen<ValueType,KeyType>::type const& src )
{
@@ -108,7 +107,6 @@
 Use it like this: 
 </blockquote></div>

-

<pre class="programlisting">ptree_gen<string,string>::type PT;
boost::archive::text_iarchive ia( std::ifstream ifs("filename") );
@@ -463,7 +461,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/introduction.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/introduction.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/introduction.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,14 +22,14 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_introduction">
<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="id769112"></a>
- <a class="link" href="introduction.html#boost_bimap.introduction.how_to_use_this_document">How to use
- this document</a>
+<h4>
+<a name="boost_bimap.introduction.h0"></a>
+ <a name="boost_bimap.introduction.how_to_use_this_document"></a><a class="link" href="introduction.html#boost_bimap.introduction.how_to_use_this_document">How
+ to use this document</a>
 </h4>

 This documentation contains a large amount of information. Whereas it may be
@@ -38,7 +38,7 @@
 
<div class="variablelist">

-<dl>
+<dl class="variablelist">
<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
@@ -98,89 +98,88 @@
 and using it is the best way of dealing with them as soon as possible.
 </td></tr>
</table></div>
-<a name="boost_bimap.introduction.navigation"></a><h4>
-<a name="id769258"></a>
- <a class="link" href="introduction.html#boost_bimap.introduction.navigation">Navigation</a>
+<h4>
+<a name="boost_bimap.introduction.h1"></a>
+ <a name="boost_bimap.introduction.navigation"></a><a class="link" href="introduction.html#boost_bimap.introduction.navigation">Navigation</a>
 </h4>

 Used in combination with the configured browser key (usually Alt), the following
 keys act as handy shortcuts for common navigation tasks.
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
-
 General
- 
-<div class="itemizedlist"><ul class="itemizedlist" type="circle">
+ <div class="itemizedlist"><ul class="itemizedlist" style="list-style-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">
+ <div class="itemizedlist"><ul class="itemizedlist" style="list-style-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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/one_minute_tutorial.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/one_minute_tutorial.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/one_minute_tutorial.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,14 +22,14 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_one_minute_tutorial">
<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="id769586"></a>
- <a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.what_is_a_bimap_">What is a
- bimap?</a>
+<h4>
+<a name="boost_bimap.one_minute_tutorial.h0"></a>
+ <a name="boost_bimap.one_minute_tutorial.what_is_a_bimap_"></a><a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.what_is_a_bimap_">What
+ is a bimap?</a>
 </h4>

 A Bimap is a data structure that represents bidirectional relations between
@@ -51,9 +51,9 @@
</pre>

 Given this code, the following is the complete description of the resulting
- bimap. [<a name="id769748" href="#ftn.id769748" class="footnote">1</a>]
+ bimap. [1]</a>
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 <code class="computeroutput">bm.left</code> is signature-compatible with <code class="computeroutput">std::map<X,Y></code>
 </li>
@@ -104,9 +104,9 @@
<code class="literal">two --> 2</code>
...
</pre>
-<a name="boost_bimap.one_minute_tutorial.layout_of_the_relation_and_the_pairs_of_a_bimap"></a><h4>
-<a name="id770430"></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
+<h4>
+<a name="boost_bimap.one_minute_tutorial.h1"></a>
+ <a name="boost_bimap.one_minute_tutorial.layout_of_the_relation_and_the_pairs_of_a_bimap"></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>

@@ -118,9 +118,10 @@

 <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="id770497"></a>
- <a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.step_by_step">Step by step</a>
+<h4>
+<a name="boost_bimap.one_minute_tutorial.h2"></a>
+ <a name="boost_bimap.one_minute_tutorial.step_by_step"></a><a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.step_by_step">Step
+ by step</a>
 </h4>

 A convinience header is avaiable in the boost directory:
@@ -131,16 +132,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="id770643"></a>
- <a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.the_collection_of_relations_view">The
+<h4>
+<a name="boost_bimap.one_minute_tutorial.h3"></a>
+ <a name="boost_bimap.one_minute_tutorial.the_collection_of_relations_view"></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>

@@ -149,28 +149,27 @@
 using this view.
 

-

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

std::cout << "There are " << bm.size() << "relations" << std::endl;

-for( bm_type::const_iterator iter = bm.begin(), iend = bm.end();
+for( bm_type::const_iterator iter = bm.begin(), iend = bm.end();
 iter != iend; ++iter )
{
- // iter->left : data : int
- // iter->right : data : std::string
-
+ // iter->left : data : int
+ // iter->right : data : std::string
+
 std::cout << iter->left << " <--> " << iter->right << std::endl;
}
</pre>

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

 <code class="computeroutput">bm.left</code> works like a <code class="computeroutput">std::map<
@@ -179,53 +178,52 @@
 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_bimap.one_minute_tutorial.c0" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.c1"><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 )
{
- // left_iter->first : key : int
- // left_iter->second : data : std::string
-
+ // left_iter->first : key : int
+ // left_iter->second : data : std::string
+
 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_bimap.one_minute_tutorial.c2" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.c3"><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_bimap.one_minute_tutorial.c4" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.c5"><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 width="5%" valign="top" align="left"><a name="boost_bimap.one_minute_tutorial.c1"></a> </td>
<td valign="top" align="left">
 The type of <code class="computeroutput">bm.left</code> is <code class="computeroutput">bm_type::left_map</code>
 and the type of <code class="computeroutput">bm.right</code> is <code class="computeroutput">bm_type::right_map</code>
 </td>
</tr>
<tr>
-<td width="5%" valign="top" align="left"><a name="boost_bimap1"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap.one_minute_tutorial.c3"></a> </td>
<td valign="top" align="left">
 <code class="computeroutput">bm_type::left_</code>-type- can be used as a shortcut
 for the more verbose <code class="computeroutput">bm_type::left_map::</code>-type-
 </td>
</tr>
<tr>
-<td width="5%" valign="top" align="left"><a name="boost_bimap2"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap.one_minute_tutorial.c5"></a> </td>
<td valign="top" align="left">
 This line produces the same effect of <code class="computeroutput">bm.insert( bm_type::value_type(3,"three")
 );</code>
 </td>
</tr>
</table></div>
-<a name="boost_bimap.one_minute_tutorial.the_right_map_view"></a><h4>
-<a name="id771810"></a>
- <a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.the_right_map_view">The right
- map view</a>
+<h4>
+<a name="boost_bimap.one_minute_tutorial.h5"></a>
+ <a name="boost_bimap.one_minute_tutorial.the_right_map_view"></a><a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.the_right_map_view">The
+ right map view</a>
 </h4>

 <code class="computeroutput">bm.right</code> works like a <code class="computeroutput">std::map<
@@ -234,33 +232,32 @@
 one, exactly as with standard maps.
 

-

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

-// right_iter->first : key : std::string
-// right_iter->second : data : int
-
+// right_iter->first : key : std::string
+// right_iter->second : data : int
+
assert( right_iter->second == 2 );

assert( bm.right.at("one") == 1 );

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_bimap.one_minute_tutorial.c6" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.c7"><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 width="5%" valign="top" align="left"><a name="boost_bimap.one_minute_tutorial.c7"></a> </td>
<td valign="top" align="left">
 This line produces the same effect of <code class="computeroutput">bm.insert( bm_type::value_type(4,"four")
 );</code>
 </td>
</tr></table></div>
-<a name="boost_bimap.one_minute_tutorial.differences_with_std__map"></a><h4>
-<a name="id772245"></a>
- <a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.differences_with_std__map">Differences
+<h4>
+<a name="boost_bimap.one_minute_tutorial.h6"></a>
+ <a name="boost_bimap.one_minute_tutorial.differences_with_std__map"></a><a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.differences_with_std__map">Differences
 with std::map</a>
 </h4>

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

 If you insert <code class="computeroutput">(1,"one")</code> and <code class="computeroutput">(1,"1")</code> in a <code class="computeroutput">std::map<int,std::string></code> the second insertion will have no effect.
 In a <code class="computeroutput">bimap<X,Y></code> both keys have to remain unique. The insertion
@@ -284,14 +281,15 @@

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

-bm.insert( bm_type::value_type( 1, "1" ) ); // No effect!
-bm.insert( bm_type::value_type( 2, "one" ) ); // No effect!
-
+bm.insert( bm_type::value_type( 1, "1" ) ); // No effect!
+bm.insert( bm_type::value_type( 2, "one" ) ); // No effect!
+
assert( bm.size() == 1 );
</pre>
-<a name="boost_bimap.one_minute_tutorial.a_simple_example"></a><h4>
-<a name="id772905"></a>
- <a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.a_simple_example">A simple example</a>
+<h4>
+<a name="boost_bimap.one_minute_tutorial.h7"></a>
+ <a name="boost_bimap.one_minute_tutorial.a_simple_example"></a><a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.a_simple_example">A
+ simple example</a>
 </h4>

 Look how you can reuse code that is intend to be used with std::maps, like
@@ -301,7 +299,6 @@
 <a href="../../../example/simple_bimap.cpp" target="_top">Go to source code</a>
 

-

<pre class="programlisting">#include <string>
#include <iostream>
@@ -323,8 +320,8 @@

int main()
{
- // Soccer World cup
-
+ // Soccer World cup
+
 typedef boost::bimap< std::string, int > results_bimap;
 typedef results_bimap::value_type position;

@@ -344,8 +341,8 @@
 std::cout << "Countries names ordered by their final position:"
 << std::endl;

- // results.right works like a std::map< int, std::string >
-
+ // results.right works like a std::map< int, std::string >
+
 print_map( results.right, ") ", std::cout );

 std::cout << std::endl
@@ -353,8 +350,8 @@
 "their final position:"
 << std::endl;

- // results.left works like a std::map< std::string, int >
-
+ // results.left works like a std::map< std::string, int >
+
 print_map( results.left, " ends in position ", std::cout );

 return 0;
@@ -381,9 +378,9 @@
<code class="literal">Germany ends in position 3</code>
<code class="literal">Spain ends in position 2</code>
</pre>
-<a name="boost_bimap.one_minute_tutorial.continuing_the_journey"></a><h4>
-<a name="id774177"></a>
- <a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.continuing_the_journey">Continuing
+<h4>
+<a name="boost_bimap.one_minute_tutorial.h8"></a>
+ <a name="boost_bimap.one_minute_tutorial.continuing_the_journey"></a><a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.continuing_the_journey">Continuing
 the journey</a>
 </h4>

@@ -407,8 +404,8 @@
 </td></tr>
</table></div>
<div class="footnotes">
- <hr width="100" align="left">
-<div class="footnote">[<a id="ftn.id769748" href="#id769748" class="para">1</a>] 
+ <hr style="width:100; align:left;">
+<div id="ftn.boost_bimap.one_minute_tutorial.f0" class="footnote">^[1]
 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.
@@ -417,7 +414,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/performance.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/performance.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/performance.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_performance">
<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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/rationale.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/rationale.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/rationale.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_rationale">
<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>
@@ -57,7 +57,7 @@
 at developers.
 </td></tr>
</table></div>
-<div class="section">
+<div class="section boost_bimap_rationale_general_design">
<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>
@@ -152,9 +152,9 @@
 This interface is easily learned by users who have a STL background, as well
 as being simple and powerful. This is the general design.
 
-<a name="boost_bimap.rationale.general_design.relation_implementation"></a><h5>
-<a name="id883219"></a>
- <a class="link" href="rationale.html#boost_bimap.rationale.general_design.relation_implementation">Relation
+<h5>
+<a name="boost_bimap.rationale.general_design.h0"></a>
+ <a name="boost_bimap.rationale.general_design.relation_implementation"></a><a class="link" href="rationale.html#boost_bimap.rationale.general_design.relation_implementation">Relation
 Implementation</a>
 </h5>

@@ -253,9 +253,9 @@
 from the code because it was never used.
 </td></tr>
</table></div>
-<a name="boost_bimap.rationale.general_design.bimap_implementation"></a><h5>
-<a name="id883786"></a>
- <a class="link" href="rationale.html#boost_bimap.rationale.general_design.bimap_implementation">Bimap
+<h5>
+<a name="boost_bimap.rationale.general_design.h1"></a>
+ <a name="boost_bimap.rationale.general_design.bimap_implementation"></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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/rationale/additional_features.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/rationale/additional_features.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/rationale/additional_features.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,14 +22,14 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_rationale_additional_features">
<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="id884065"></a>
- <a class="link" href="additional_features.html#boost_bimap.rationale.additional_features.n_1__n_n__hashed_maps">N-1,
+<h5>
+<a name="boost_bimap.rationale.additional_features.h0"></a>
+ <a name="boost_bimap.rationale.additional_features.n_1__n_n__hashed_maps"></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>

@@ -40,7 +40,7 @@
 collection type of each key directly. In order to implement this feature,
 we have to solve two problems:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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.
@@ -59,9 +59,9 @@

 <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="id884180"></a>
- <a class="link" href="additional_features.html#boost_bimap.rationale.additional_features.collection_type_of_relation_constraints">Collection
+<h5>
+<a name="boost_bimap.rationale.additional_features.h1"></a>
+ <a name="boost_bimap.rationale.additional_features.collection_type_of_relation_constraints"></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>

@@ -72,7 +72,7 @@
 bases the collection type of relations on the left collection type, but the
 user may choose between:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 left_based
 </li>
@@ -103,9 +103,9 @@
 and for this reason, these are the preferred options. The implementation
 uses further metaprogramming to define a new index if necessary.
 
-<a name="boost_bimap.rationale.additional_features.tagged"></a><h5>
-<a name="id884293"></a>
- <a class="link" href="additional_features.html#boost_bimap.rationale.additional_features.tagged">Tagged</a>
+<h5>
+<a name="boost_bimap.rationale.additional_features.h2"></a>
+ <a name="boost_bimap.rationale.additional_features.tagged"></a><a class="link" href="additional_features.html#boost_bimap.rationale.additional_features.tagged">Tagged</a>
 </h5>

 The idea of using tags instead of the <code class="literal">member_at::side</code>
@@ -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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/rationale/code.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/rationale/code.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/rationale/code.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_rationale_code">
<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="id884408"></a>Table 1.10. folders in boost/bimap
+<a name="boost_bimap.rationale.code.t0"></a>Table 1.10. folders in boost/bimap
<div class="table-contents"><table class="table" summary="folders in boost/bimap">
<colgroup>
<col>
@@ -125,7 +125,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id884547"></a>Table 1.11. folders in each folder
+<a name="boost_bimap.rationale.code.t1"></a>Table 1.11. folders in each folder
<div class="table-contents"><table class="table" summary="folders in each folder">
<colgroup>
<col>
@@ -184,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/rationale/the_student_and_the_mentor.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/rationale/the_student_and_the_mentor.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/rationale/the_student_and_the_mentor.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_rationale_the_student_and_the_mentor">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.rationale.the_student_and_the_mentor"></a><a class="link" href="the_student_and_the_mentor.html" title="The student and the mentor">The
 student and the mentor</a>
@@ -408,7 +408,7 @@
 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).
+ layout-compatibility subject in it (http://www.kuzbass.ru/docs/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. 
@@ -425,7 +425,6 @@
 B and A. 
 </blockquote></div>

-

<pre class="programlisting">relation<TA,TB> r;
const_reference_pair<A,B> pba(r);
@@ -706,7 +705,6 @@
 in concrete to the copy of map_views. 
 </blockquote></div>

-

<pre class="programlisting">map_view x=...;
map_view y=...;
@@ -749,7 +747,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/reference.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/reference.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/reference.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_reference">
<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>
@@ -32,7 +32,7 @@
<dd><dl>
<dt><a href="reference/bimap_reference.html#boost_bimap.reference.bimap_reference.view_concepts">View
 concepts</a></dt>
-<dt><a href="reference/bimap_reference.html#boost_bimap.reference.bimap_reference.complexity_signature"> Complexity
+<dt><a href="reference/bimap_reference.html#boost_bimap.reference.bimap_reference.complexity_signature">Complexity
 signature</a></dt>
<dt><a href="reference/bimap_reference.html#boost_bimap.reference.bimap_reference.set_type_specification">Set
 type specification</a></dt>
@@ -89,7 +89,7 @@
 Views</a></dt>
</dl></dd>
</dl></div>
-<div class="section">
+<div class="section boost_bimap_reference_headers">
<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>
@@ -99,21 +99,21 @@

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

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

 Set Types
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 "boost/bimap/set_of.hpp"
 </li>
@@ -139,7 +139,7 @@

 Boost Integration
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 "boost/bimap/support/lambda.hpp"
 </li>
@@ -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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/reference/bimap_reference.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/reference/bimap_reference.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/reference/bimap_reference.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,14 +22,14 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_reference_bimap_reference">
<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>
<div class="toc"><dl>
<dt><a href="bimap_reference.html#boost_bimap.reference.bimap_reference.view_concepts">View
 concepts</a></dt>
-<dt><a href="bimap_reference.html#boost_bimap.reference.bimap_reference.complexity_signature"> Complexity
+<dt><a href="bimap_reference.html#boost_bimap.reference.bimap_reference.complexity_signature">Complexity
 signature</a></dt>
<dt><a href="bimap_reference.html#boost_bimap.reference.bimap_reference.set_type_specification">Set
 type specification</a></dt>
@@ -46,14 +46,14 @@
 types</a></dt>
<dt><a href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.constructors__copy_and_assignment">Constructors,
 copy and assignment</a></dt>
-<dt><a href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.projection_operations"> Projection
+<dt><a href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.projection_operations">Projection
 operations</a></dt>
-<dt><a href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.support_for_user_defined_names"> Support
+<dt><a href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.support_for_user_defined_names">Support
 for user defined names</a></dt>
<dt>Serialization</dt>
</dl></dd>
</dl></div>
-<div class="section">
+<div class="section boost_bimap_reference_bimap_reference_view_concepts">
<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>
@@ -79,7 +79,7 @@
 (such as uniqueness of elements). The global operations performed jointly
 in the any view can be reduced to six primitives:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 copying
 </li>
@@ -111,9 +111,9 @@
 fashion.
 
</div>
-<div class="section">
+<div class="section boost_bimap_reference_bimap_reference_complexity_signature">
<div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.reference.bimap_reference.complexity_signature"></a><a name="complexity_signature_explanation"></a> <a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.complexity_signature" title="Complexity signature">Complexity
+<a name="boost_bimap.reference.bimap_reference.complexity_signature"></a><a name="complexity_signature_explanation"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.complexity_signature" title="Complexity signature">Complexity
 signature</a>
</h4></div></div></div>

@@ -127,7 +127,7 @@
 its complexity signature, consisting of the following associated functions
 on the number of elements:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 <code class="computeroutput">c(n)</code>:
 copying
@@ -166,7 +166,7 @@
 to denote the above view, the complexity of insertion will now be <code class="computeroutput">O(i_l(n)+i_r(n)+i_a(n))</code>.
 To abbreviate the notation, we adopt the following definitions:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 <code class="computeroutput">C(n) = c_l(n) + c_r(n) [ + c_a(n) ]</code>
 </li>
@@ -187,7 +187,7 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_bimap_reference_set_type_specification">
<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>
@@ -377,7 +377,7 @@
</tbody>
</table></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_bimap_reference_tags">
<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">
+<div class="section boost_bimap_reference_bimap_reference_header__boost_bimap_bimap_hpp__synopsis">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.bimap_reference.header__boost_bimap_bimap_hpp__synopsis"></a><a 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>
@@ -398,8 +398,8 @@
template< class Type, typename Tag >
struct tagged;

-// bimap template class
-
+// bimap template class
+
template
<
 class LeftCollectionType, class RightCollectionType,
@@ -411,26 +411,26 @@
{
 public:

- // Metadata
-
+ // Metadata
+
 typedef -unspecified- left_tag;
 typedef -unspecified- left_map;

 typedef -unspecified- right_tag;
 typedef -unspecified- right_map;

- // Shortcuts
- // typedef -side-_map::-type- -side-_-type-;
-
+ // Shortcuts
+ // typedef -side-_map::-type- -side-_-type-;
+
 typedef -unspecified- info_type;

- // Map views
-
+ // Map views
+
 left_map left;
 right_map right;

- // Constructors
-
+ // Constructors
+
 bimap();

 template< class InputIterator >
@@ -440,8 +440,8 @@

 bimap& operator=(const bimap& b);

- // Projection of iterators
-
+ // Projection of iterators
+
 template< class IteratorType >
 left_iterator project_left(IteratorType iter);

@@ -460,8 +460,8 @@
 template< class IteratorType >
 const_iterator project_up(IteratorType iter) const;

- // Support for tags
-
+ // Support for tags
+
 template< class Tag >
 struct map_by;

@@ -480,11 +480,11 @@
};

-} // namespace bimap
-} // namespace boost
-</pre>
+} // namespace bimap
+} // namespace boost
+</pre>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_bimap_reference_class_template_bimap">
<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>
@@ -497,16 +497,16 @@
 types</a></dt>
<dt><a href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.constructors__copy_and_assignment">Constructors,
 copy and assignment</a></dt>
-<dt><a href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.projection_operations"> Projection
+<dt><a href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.projection_operations">Projection
 operations</a></dt>
-<dt><a href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.support_for_user_defined_names"> Support
+<dt><a href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.support_for_user_defined_names">Support
 for user defined names</a></dt>
<dt>Serialization</dt>
</dl></div>

 This is the main component of Boost.Bimap.
 
-<div class="section">
+<div class="section boost_bimap_reference_bimap_reference_class_template_bimap_complexity">
<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">
+<div class="section boost_bimap_reference_bimap_reference_class_template_bimap_instantiation_types">
<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>
@@ -531,21 +531,19 @@
 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">
+ <div class="itemizedlist"><ul class="itemizedlist" style="list-style-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">
+<div class="section boost_bimap_reference_bimap_reference_class_template_bimap_nested_types">
<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>
@@ -589,14 +587,14 @@
 <code class="computeroutput">Bimap::map_by<Tag>::type</code>.
 </blockquote></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_bimap_reference_class_template_bimap_constructors__copy_and_assignment">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.bimap_reference.class_template_bimap.constructors__copy_and_assignment"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.constructors__copy_and_assignment" title="Constructors, copy and assignment">Constructors,
 copy and assignment</a>
</h5></div></div></div>
<pre class="programlisting">bimap();
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Effects: Constructs an empty <code class="computeroutput">bimap</code>.
 </li>
@@ -607,7 +605,7 @@
<pre class="programlisting">template<typename InputIterator>
bimap(InputIterator first,InputIterator last);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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
@@ -627,7 +625,7 @@
</ul></div>
<pre class="programlisting">bimap(const bimap & x);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Effects: Constructs a copy of x,
 copying its elements as well as its internal objects (key extractors,
@@ -646,7 +644,7 @@
</ul></div>
<pre class="programlisting">~bimap()
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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.
@@ -657,7 +655,7 @@
</ul></div>
<pre class="programlisting">bimap& operator=(const bimap& x);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Effects: Replaces the elements and
 internal objects of the <code class="computeroutput">bimap</code>
@@ -681,9 +679,9 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_bimap_reference_class_template_bimap_projection_operations">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.bimap_reference.class_template_bimap.projection_operations"></a><a name="reference_projection_operations"></a> <a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.projection_operations" title="Projection operations">Projection
+<a name="boost_bimap.reference.bimap_reference.class_template_bimap.projection_operations"></a><a name="reference_projection_operations"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.projection_operations" title="Projection operations">Projection
 operations</a>
</h5></div></div></div>

@@ -691,7 +689,7 @@
 v1 and v2, we say than an v1-iterator it1 and an v2-iterator it2 are
 equivalent if:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 <code class="computeroutput">it1 ==
 i1.end()</code>
@@ -708,7 +706,7 @@
template< class IteratorType >
left_const_iterator project_left(IteratorType iter) const;
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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
@@ -732,7 +730,7 @@
template< class IteratorType >
right_const_iterator project_right(IteratorType iter) const;
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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
@@ -756,7 +754,7 @@
template< class IteratorType >
const_iterator project_up(IteratorType iter) const;
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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
@@ -775,15 +773,15 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_bimap_reference_class_template_bimap_support_for_user_defined_names">
<div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.bimap_reference.class_template_bimap.support_for_user_defined_names"></a><a name="reference_support_for_used_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
+<a name="boost_bimap.reference.bimap_reference.class_template_bimap.support_for_user_defined_names"></a><a name="reference_support_for_used_defined_names"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.support_for_user_defined_names" title="Support for user defined names">Support
 for user defined names</a>
</h5></div></div></div>
<pre class="programlisting">template< class Tag >
struct map_by;
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>.
@@ -801,7 +799,7 @@
template< class Tag >
const map_by<Tag>::type & by() const;
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">Tag</code>
 is a valid user defined name of the bimap.
@@ -824,7 +822,7 @@
template< class Tag, class IteratorType >
map_by<Tag>::const_iterator project(IteratorType iter) const
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>
@@ -845,7 +843,7 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_bimap_reference_class_template_bimap_serialization">
<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>
@@ -872,7 +870,7 @@
 is serialization-compatible with <code class="computeroutput">p</code>
 if
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>

@@ -887,7 +885,7 @@
 to an output archive (XML archive) ar.
 
</div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: Value is serializable
 (XML-serializable). Additionally, each of the views of b can impose
@@ -906,7 +904,7 @@
 archive) ar.
 
</div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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.
@@ -921,7 +919,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/reference/list_of_reference.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/reference/list_of_reference.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/reference/list_of_reference.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_reference_list_of_reference">
<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>
@@ -32,7 +32,7 @@
<dt><a href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views">list_of
 Views</a></dt>
<dd><dl>
-<dt><a href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.complexity_signature"> Complexity
+<dt><a href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.complexity_signature">Complexity
 signature</a></dt>
<dt><a href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.instantiation_types">Instantiation
 types</a></dt>
@@ -48,7 +48,7 @@
<dt>Serialization</dt>
</dl></dd>
</dl></div>
-<div class="section">
+<div class="section boost_bimap_reference_list_of_reference_header__boost_bimap_list_of_hpp__synopsis">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.list_of_reference.header__boost_bimap_list_of_hpp__synopsis"></a><a 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>
@@ -63,17 +63,17 @@
struct list_of_relation;

-} // namespace bimap
-} // namespace boost
-</pre>
+} // namespace bimap
+} // namespace boost
+</pre>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_list_of_reference_list_of_views">
<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>
</h4></div></div></div>
<div class="toc"><dl>
-<dt><a href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.complexity_signature"> Complexity
+<dt><a href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.complexity_signature">Complexity
 signature</a></dt>
<dt><a href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.instantiation_types">Instantiation
 types</a></dt>
@@ -108,7 +108,7 @@

 There are a number of differences with respect to <code class="computeroutput">std::lists</code>:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 list_of views are not Assignable
 (like any other view.)
@@ -141,8 +141,8 @@
{
 public:

- // types
-
+ // types
+
 typedef -unspecified- value_type;
 typedef -unspecified- allocator_type;
 typedef -unspecified- reference;
@@ -158,8 +158,8 @@

 typedef -unspecified- info_type;

- // construct/copy/destroy
-
+ // construct/copy/destroy
+
 this_type & operator=(const this_type & x);

 template< class InputIterator >
@@ -169,8 +169,8 @@

 allocator_type get_allocator() const;

- // iterators
-
+ // iterators
+
 iterator begin();
 const_iterator begin() const;

@@ -183,8 +183,8 @@
 reverse_iterator rend();
 const_reverse_iterator rend() const;

- // capacity
-
+ // capacity
+
 bool empty() const;

 size_type size() const;
@@ -193,13 +193,13 @@

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

- // access
-
+ // access
+
 const_reference front() const;
 const_reference back() const;

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

@@ -218,9 +218,13 @@

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

- // Only in map views
- // {
-
+ // Only in map views
+ // {
+
+ typedef -unspecified- key_type;
+ typedef -unspecified- mapped_type;
+ typedef -unspecified- mapped_type; // Equal to mapped_type
+
 template< class CompatibleKey >
 bool <a class="link" href="list_of_reference.html#reference_list_of_replace_key_iterator_key">replace_key</a>(iterator position, const CompatibleKey & x);

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

- // }
-
+ // }
+

 void clear();

- // list operations
-
+ // list operations
+
 void <a class="link" href="list_of_reference.html#reference_list_of_splice_iterator_this">splice</a>(iterator position, this_type & x);
 void <a class="link" href="list_of_reference.html#reference_list_of_splice_iterator_this_iterator">splice</a>(iterator position, this_type & x, iterator i);
 void splice(
@@ -267,15 +271,15 @@

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

- // rearrange operations
-
+ // rearrange operations
+
 void relocate(iterator position, iterator i);
 void relocate(iterator position, iterator first, iterator last);

}

-// view comparison
-
+// view comparison
+
bool operator==(const this_type & v1, const this_type & v2 );
bool operator< (const this_type & v1, const this_type & v2 );
bool operator!=(const this_type & v1, const this_type & v2 );
@@ -283,10 +287,10 @@
bool operator>=(const this_type & v1, const this_type & v2 );
bool operator<=(const this_type & v1, const this_type & v2 );

-} // namespace views
-} // namespace bimap
-} // namespace boost
-</pre>
+} // namespace views
+} // namespace bimap
+} // namespace boost
+</pre>

 In the case of a <code class="computeroutput">bimap< list_of<Left>, ... ></code>
 
@@ -300,7 +304,7 @@
 In the left map view:
 
<pre class="programlisting">typedef Left key_type;
-typedef ... data_type;
+typedef ... mapped_type;

typedef signature-compatible with std::pair< Left, ... > value_type;
</pre>
@@ -308,13 +312,13 @@
 In the right map view:
 
<pre class="programlisting">typedef ... key_type;
-typedef Left data_type;
+typedef Left mapped_type;

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

@@ -322,7 +326,7 @@
 views, we adopt the scheme outlined in the <a class="link" href="bimap_reference.html#complexity_signature_explanation">complexity
 signature section</a>. The complexity signature of a <code class="computeroutput">list_of</code> view is:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 copying: <code class="computeroutput">c(n) = n * log(n)</code>,
 </li>
@@ -347,7 +351,7 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_list_of_reference_list_of_views_instantiation_types">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.list_of_reference.list_of_views.instantiation_types"></a><a 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,7 +362,7 @@
 specified by means of the collection type specifiers and the bimap itself.
 Instantiations are dependent on the following types:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 <code class="computeroutput">Value</code> from <code class="computeroutput">list_of</code>,
 </li>
@@ -367,7 +371,7 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_list_of_reference_list_of_views_constructors__copy_and_assignment">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.list_of_reference.list_of_views.constructors__copy_and_assignment"></a><a 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,7 +382,7 @@
 
<pre class="programlisting">this_type & operator=(const this_type & x);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>
@@ -391,7 +395,7 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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
@@ -407,7 +411,7 @@
</ul></div>
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
 Effects: <code class="computeroutput">clear(); for(size_type
 i =
 0;
@@ -416,14 +420,14 @@
 ++n) push_back(v);</code>
 </li></ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_list_of_reference_list_of_views_capacity_operations">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.list_of_reference.list_of_views.capacity_operations"></a><a 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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Effects: <code class="computeroutput">if( n > size() ) insert(end(),
 n -
@@ -443,13 +447,13 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_list_of_reference_list_of_views_modifiers">
<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);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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.
@@ -472,7 +476,7 @@
</ul></div>
<a name="reference_list_of_push_back_value"></a><pre class="programlisting">std::pair<iterator,bool> push_back(const value_type & x);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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.
@@ -495,7 +499,7 @@
</ul></div>
<a name="reference_list_of_insert_iterator_value"></a><pre class="programlisting">std::pair<iterator,bool> insert(iterator position, const value_type & x);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">position</code>
 is a valid <code class="computeroutput">iterator</code>
@@ -524,7 +528,7 @@
</ul></div>
<a name="reference_list_of_insert_iterator_size_value"></a><pre class="programlisting">void insert(iterator position, size_type n, const value_type & x);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">position</code>
 is a valid <code class="computeroutput">iterator</code>
@@ -542,7 +546,7 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">position</code>
 is a valid <code class="computeroutput">iterator</code>
@@ -568,7 +572,7 @@
</ul></div>
<a name="reference_list_of_erase_iterator"></a><pre class="programlisting">iterator erase(iterator position);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">position</code>
 is a valid dereferenceable <code class="computeroutput">iterator</code>
@@ -591,9 +595,9 @@
 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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">[first,last)</code>
 is a valid range of the view.
@@ -615,7 +619,7 @@
</ul></div>
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">position</code>
 is a valid dereferenceable iterator of the view.
@@ -647,7 +651,7 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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
@@ -683,11 +687,11 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>.
+ <code class="computeroutput">mapped_type</code>.
 </li>
<li class="listitem">
 Effects: Assigns the value <code class="computeroutput">x</code> to <code class="computeroutput">e.second</code>,
@@ -719,7 +723,7 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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
@@ -758,11 +762,11 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>
+ Function</a> accepting arguments of type: <code class="computeroutput">mapped_type&</code>; <code class="computeroutput">position</code>
 is a valid dereferenceable iterator of the view.
 </li>
<li class="listitem">
@@ -795,7 +799,7 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_list_of_reference_list_of_views_list_operations">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.list_of_reference.list_of_views.list_operations"></a><a class="link" href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.list_operations" title="List operations">List
 operations</a>
@@ -811,7 +815,7 @@
 
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view. <code class="computeroutput">&x!=this</code>.
@@ -833,7 +837,7 @@
</ul></div>
<a name="reference_list_of_splice_iterator_this_iterator"></a><pre class="programlisting">void splice(iterator position, this_type & x,iterator i);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view. <code class="computeroutput">i</code>
@@ -862,7 +866,7 @@
</ul></div>
<a name="reference_list_of_splice_iterator_this_iterator_iterator"></a><pre class="programlisting">void splice(iterator position, this_type & x, iterator first, iterator last);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view. <code class="computeroutput">first</code>
@@ -895,7 +899,7 @@
</ul></div>
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Effects: Erases all elements of
 the view which compare equal to <code class="computeroutput">value</code>.
@@ -911,7 +915,7 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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.
@@ -926,7 +930,7 @@
</ul></div>
<a name="reference_list_of_unique"></a><pre class="programlisting">void unique();
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Effects: Eliminates all but the
 first element from every consecutive group of equal elements referred
@@ -944,7 +948,7 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Effects: Eliminates all but the
 first element from every consecutive group of elements referred to
@@ -961,7 +965,7 @@
</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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>.
@@ -998,7 +1002,7 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>.
@@ -1034,7 +1038,7 @@
</ul></div>
<a name="reference_list_of_sort"></a><pre class="programlisting">void sort();
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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.
@@ -1060,7 +1064,7 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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.
@@ -1084,7 +1088,7 @@
</ul></div>
<a name="reference_list_of_reverse"></a><pre class="programlisting">void reverse();
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Effects: Reverses the order of the
 elements in the view.
@@ -1101,7 +1105,7 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_list_of_reference_list_of_views_rearrange_operations">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.list_of_reference.list_of_views.rearrange_operations"></a><a class="link" href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.rearrange_operations" title="Rearrange operations">Rearrange
 operations</a>
@@ -1113,7 +1117,7 @@
 
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view. <code class="computeroutput">i</code>
@@ -1137,7 +1141,7 @@
</ul></div>
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view. <code class="computeroutput">first</code>
@@ -1163,7 +1167,7 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_list_of_reference_list_of_views_serialization">
<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>
@@ -1182,7 +1186,7 @@
 ar.
 
</div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
 Requires: No additional requirements
 to those imposed by the container.
 </li></ul></div>
@@ -1193,7 +1197,7 @@
 archive) ar.
 
</div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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(),
@@ -1209,7 +1213,7 @@
 it to an output archive (XML archive) ar.
 
</div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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.
@@ -1222,7 +1226,7 @@
 archive) ar.
 
</div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>,
@@ -1240,7 +1244,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/reference/set_of_reference.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/reference/set_of_reference.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/reference/set_of_reference.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_reference_set_of_reference">
<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>
@@ -36,7 +36,7 @@
<dt><a href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views">[multi]set_of
 Views</a></dt>
<dd><dl>
-<dt><a href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.complexity_signature"> Complexity
+<dt><a href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.complexity_signature">Complexity
 signature</a></dt>
<dt><a href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.instantiation_types">Instantiation
 types</a></dt>
@@ -52,7 +52,7 @@
<dt>Serialization</dt>
</dl></dd>
</dl></div>
-<div class="section">
+<div class="section boost_bimap_reference_set_of_reference_header__boost_bimap_set_of_hpp__synopsis">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.set_of_reference.header__boost_bimap_set_of_hpp__synopsis"></a><a 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>
@@ -76,11 +76,11 @@
struct set_of_relation;

-} // namespace bimap
-} // namespace boost
-</pre>
+} // namespace bimap
+} // namespace boost
+</pre>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_set_of_reference_header__boost_bimap_multiset_of_hpp__synopsis">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.set_of_reference.header__boost_bimap_multiset_of_hpp__synopsis"></a><a 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>
@@ -104,11 +104,11 @@
struct multiset_of_relation;

-} // namespace bimap
-} // namespace boost
-</pre>
+} // namespace bimap
+} // namespace boost
+</pre>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_set_of_reference_collection_type_specifiers_set_of_and_multiset_of">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.set_of_reference.collection_type_specifiers_set_of_and_multiset_of"></a><a 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,13 +119,13 @@
 coincide, so they are described together.
 
</div>
-<div class="section">
+<div class="section boost_bimap_reference_set_of_reference___multi__set_of_views">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views"></a><a class="link" href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views" title="[multi]set_of Views">[multi]set_of
 Views</a>
</h4></div></div></div>
<div class="toc"><dl>
-<dt><a href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.complexity_signature"> Complexity
+<dt><a href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.complexity_signature">Complexity
 signature</a></dt>
<dt><a href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.instantiation_types">Instantiation
 types</a></dt>
@@ -155,198 +155,199 @@
 If you look the bimap from a side, you will use a map view, and if you
 look at it as a whole, you will be using a set view.
 
-<pre class="programlisting">namespace boost {
-namespace bimaps {
-namespace views {
+<pre class="programlisting"> namespace boost {
+ namespace bimaps {
+ namespace views {

-template< -implementation defined parameter list- >
-class -implementation defined view name-
-{
- public:
+ template< -implementation defined parameter list- >
+ class -implementation defined view name-
+ {
+ public:

- typedef -unspecified- key_type;
- typedef -unspecified- value_type;
- typedef -unspecified- key_compare;
- typedef -unspecified- value_compare;
- typedef -unspecified- allocator_type;
- typedef -unspecified- reference;
- typedef -unspecified- const_reference;
- typedef -unspecified- iterator;
- typedef -unspecified- const_iterator;
- typedef -unspecified- size_type;
- typedef -unspecified- difference_type;
- typedef -unspecified- pointer;
- typedef -unspecified- const_pointer;
- typedef -unspecified- reverse_iterator;
- typedef -unspecified- const_reverse_iterator;
+ typedef -unspecified- key_type;
+typedef -unspecified- value_type;
+ typedef -unspecified- key_compare;
+ typedef -unspecified- value_compare;
+ typedef -unspecified- allocator_type;
+ typedef -unspecified- reference;
+ typedef -unspecified- const_reference;
+ typedef -unspecified- iterator;
+ typedef -unspecified- const_iterator;
+ typedef -unspecified- size_type;
+ typedef -unspecified- difference_type;
+ typedef -unspecified- pointer;
+ typedef -unspecified- const_pointer;
+ typedef -unspecified- reverse_iterator;
+ typedef -unspecified- const_reverse_iterator;

- typedef -unspecified- info_type;
+ typedef -unspecified- info_type;

- this_type & operator=(const this_type & x);
+ this_type & operator=(const this_type & x);

- allocator_type get_allocator() const;
+ allocator_type get_allocator() const;

- // iterators
-
- iterator begin();
- const_iterator begin() const;
+ // iterators

- iterator end();
- const_iterator end() const;
+ iterator begin();
+ const_iterator begin() const;

- reverse_iterator rbegin();
- const_reverse_iterator rbegin() const;
+ iterator end();
+ const_iterator end() const;

- reverse_iterator rend();
- const_reverse_iterator rend() const;
+ reverse_iterator rbegin();
+ const_reverse_iterator rbegin() const;

- // capacity
-
- bool empty() const;
+ reverse_iterator rend();
+ const_reverse_iterator rend() const;

- size_type size() const;
+ // capacity

- size_type max_size() const;
+ bool empty() const;

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

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

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

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

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

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

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

- // Only in map views
- // {
-
 template< class CompatibleKey >
- bool <a class="link" href="set_of_reference.html#reference_set_of_replace_key_iterator_key">replace_key</a>(iterator position, const CompatibleKey & x);
+ size_type <a class="link" href="set_of_reference.html#reference_set_of_erase_key">erase</a>(const CompatibleKey & x);

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

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

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

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

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

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

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

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

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

+ void clear();

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

+ key_compare key_comp() const;

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

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

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

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

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

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

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

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

- // Only in maps views
- // {
-
- template< class LowerBounder, class UpperBounder>
- std::pair<iterator,iterator> <a class="link" href="set_of_reference.html#reference_set_of_range_lower_upper">range</a>(
- LowerBounder lower, UpperBounder upper);
+ template< class CompatibleKey >
+ const_iterator <a class="link" href="set_of_reference.html#reference_set_of_lower_bound_key">lower_bound</a>(const CompatibleKey & x) const;

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

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

- // Only in for `set_of` collection type
- // {
-
 template< class CompatibleKey >
- const data_type & <a class="link" href="set_of_reference.html#reference_set_of_at_key_const">at</a>(const CompatibleKey & k) const;
+ const_iterator <a class="link" href="set_of_reference.html#reference_set_of_upper_bound_key">upper_bound</a>(const CompatibleKey & x) const;

- // Only if the other collection type is mutable
- // {
-
- template< class CompatibleKey >
- data_type & <a class="link" href="set_of_reference.html#reference_set_of_operator_bracket_key">operator[]</a>(const CompatibleKey & k);

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

- // }
-
- // Only if info_hook is used
- // {
-
- template< class CompatibleKey >
- info_type & <a class="link" href="set_of_reference.html#reference_set_of_info_at_key">info_at</a>(const CompatibleKey & k);
+ template< class CompatibleKey >
+ std::pair<const_iterator,const_iterator>
+ <a class="link" href="set_of_reference.html#reference_set_of_equal_range_key">equal_range</a>(const CompatibleKey & x) const;
+
+ // Only in maps views
+ // {
+
+ template< class LowerBounder, class UpperBounder>
+ std::pair<iterator,iterator> <a class="link" href="set_of_reference.html#reference_set_of_range_lower_upper">range</a>(
+ LowerBounder lower, UpperBounder upper);
+
+ template< class LowerBounder, class UpperBounder>
+ std::pair<const_iterator,const_iterator> <a class="link" href="set_of_reference.html#reference_set_of_range_lower_upper">range</a>(
+ LowerBounder lower, UpperBounder upper) const;
+
+ typedef -unspecified- mapped_type;
+ typedef -unspecified- data_type; // Equal to mapped_type
+
+ // Only in for `set_of` collection type
+ // {

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

- // }
-
- // }
-
- // }
-};
-
-// view comparison
-
-bool operator==(const this_type & v1, const this_type & v2 );
-bool operator< (const this_type & v1, const this_type & v2 );
-bool operator!=(const this_type & v1, const this_type & v2 );
-bool operator> (const this_type & v1, const this_type & v2 );
-bool operator>=(const this_type & v1, const this_type & v2 );
-bool operator<=(const this_type & v1, const this_type & v2 );
-
-} // namespace views
-} // namespace bimap
-} // namespace boost
-</pre>
+ // Only if the other collection type is mutable
+ // {
+
+ template< class CompatibleKey >
+ mapped_type & <a class="link" href="set_of_reference.html#reference_set_of_operator_bracket_key">operator[]</a>(const CompatibleKey & k);
+
+ template< class CompatibleKey >
+ mapped_type & <a class="link" href="set_of_reference.html#reference_set_of_at_key">at</a>(const CompatibleKey & k);
+
+ // }
+
+ // Only if info_hook is used
+ // {
+
+ template< class CompatibleKey >
+ info_type & <a class="link" href="set_of_reference.html#reference_set_of_info_at_key">info_at</a>(const CompatibleKey & k);
+
+ template< class CompatibleKey >
+ const info_type & <a class="link" href="set_of_reference.html#reference_set_of_info_at_key">info_at</a>(const CompatibleKey & k) const;
+
+ // }
+
+ // }
+
+ // }
+ };
+
+ // view comparison
+
+ bool operator==(const this_type & v1, const this_type & v2 );
+ bool operator< (const this_type & v1, const this_type & v2 );
+ bool operator!=(const this_type & v1, const this_type & v2 );
+ bool operator> (const this_type & v1, const this_type & v2 );
+ bool operator>=(const this_type & v1, const this_type & v2 );
+ bool operator<=(const this_type & v1, const this_type & v2 );
+
+ } // namespace views
+ } // namespace bimap
+ } // namespace boost
+</pre>

 In the case of a <code class="computeroutput">bimap< {multi}set_of<Left>, ... ></code>
 
@@ -360,7 +361,7 @@
 In the left map view:
 
<pre class="programlisting">typedef Left key_type;
-typedef ... data_type;
+typedef ... mapped_type;

typedef signature-compatible with std::pair< const Left, ... > value_type;
</pre>
@@ -368,13 +369,13 @@
 In the right map view:
 
<pre class="programlisting">typedef ... key_type;
-typedef Left data_type;
+typedef Left mapped_type;

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

@@ -383,7 +384,7 @@
 signature section</a>. The complexity signature of [multi]set_of view
 is:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 copying: <code class="computeroutput">c(n) = n * log(n)</code>,
 </li>
@@ -409,7 +410,7 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_set_of_reference___multi__set_of_views_instantiation_types">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.instantiation_types"></a><a 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>
@@ -418,7 +419,7 @@
 Set views are instantiated internally to a <code class="computeroutput">bimap</code>.
 Instantiations are dependent on the following types:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 <code class="computeroutput">Value</code> from the set
 specifier,
@@ -436,7 +437,7 @@
 Weak Ordering</a> on elements of <code class="computeroutput">Value</code>.
 
</div>
-<div class="section">
+<div class="section boost_bimap_reference_set_of_reference___multi__set_of_views_constructors__copy_and_assignment">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.constructors__copy_and_assignment"></a><a 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>
@@ -447,7 +448,7 @@
 
<pre class="programlisting">this_type & operator=(const this_type & x);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>
@@ -458,30 +459,28 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_set_of_reference___multi__set_of_views_modifiers">
<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);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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">
+ <div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: circle; ">
<li class="listitem">
- 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>
+ 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>
</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>
@@ -500,28 +499,26 @@
</ul></div>
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 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">
+ <div class="itemizedlist"><ul class="itemizedlist" style="list-style-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
@@ -539,7 +536,7 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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
@@ -573,7 +570,7 @@
</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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">position</code>
 is a valid dereferenceable iterator if the set view.
@@ -598,7 +595,7 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">CompatibleKey</code>
 is a compatible key of <code class="computeroutput">key_compare</code>.
@@ -620,7 +617,7 @@
</ul></div>
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">[first,last)</code>
 is a valid range of the view.
@@ -642,28 +639,26 @@
</ul></div>
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 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">
+ <div class="itemizedlist"><ul class="itemizedlist" style="list-style-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.
@@ -686,30 +681,28 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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">
+ <div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>
+ 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>
+ 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.
@@ -732,30 +725,28 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>.
+ <code class="computeroutput">mapped_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">
+ <div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>
+ 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>
+ 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.
@@ -778,7 +769,7 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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
@@ -786,23 +777,21 @@
 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">
+ <div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: circle; ">
<li class="listitem">
- the map view is non-unique OR no other element with equivalent
- key exists,
- </li>
+ 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>
+ AND rearrangement is allowed by all other views of the <code class="computeroutput">bimap</code>.
+ </li>
</ul></div>
-</li>
+ </li>
<li class="listitem">
 Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
 succeeds.
@@ -828,31 +817,29 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>
+ Function</a> accepting arguments of type: <code class="computeroutput">mapped_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">
+ <div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: circle; ">
<li class="listitem">
- the oppositte map view is non-unique OR no other element with
- equivalent key in that view exists,
- </li>
+ 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>
+ AND rearrangement is allowed by all other views of the <code class="computeroutput">bimap</code>.
+ </li>
</ul></div>
-</li>
+ </li>
<li class="listitem">
 Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
 succeeds.
@@ -876,7 +863,7 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_set_of_reference___multi__set_of_views_set_operations">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.set_operations"></a><a 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,7 +893,7 @@
template< class CompatibleKey >
const_iterator find(const CompatibleKey & x) const;
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">CompatibleKey</code>
 is a compatible key of <code class="computeroutput">key_compare</code>.
@@ -924,7 +911,7 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">CompatibleKey</code>
 is a compatible key of <code class="computeroutput">key_compare</code>.
@@ -943,7 +930,7 @@
template< class CompatibleKey >
const_iterator lower_bound(const key_type & x) const;
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">CompatibleKey</code>
 is a compatible key of <code class="computeroutput">key_compare</code>.
@@ -964,7 +951,7 @@
template< class CompatibleKey >
const_iterator upper_bound(const key_type & x) const;
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">CompatibleKey</code>
 is a compatible key of <code class="computeroutput">key_compare</code>.
@@ -984,10 +971,10 @@
 equal_range(const key_type & x);

template< class CompatibleKey >
-std::pair<const_iterator,const_iterator>
+std::pair<const_iterator,const_iterator>
 equal_range(const key_type & x) const;
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">CompatibleKey</code>
 is a compatible key of <code class="computeroutput">key_compare</code>.
@@ -1000,7 +987,7 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_set_of_reference___multi__set_of_views_range_operations">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.range_operations"></a><a 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>
@@ -1019,7 +1006,7 @@
 is said to be a lower bounder of <code class="computeroutput">Compare</code>
 if
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 <code class="computeroutput">LowerBounder</code> is a
 <code class="computeroutput">Predicate</code> over <code class="computeroutput">Key</code>,
@@ -1036,7 +1023,7 @@
 Similarly, an upper bounder is a type <code class="computeroutput">UpperBounder</code>
 such that
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 <code class="computeroutput">UpperBounder</code> is a
 <code class="computeroutput">Predicate</code> over <code class="computeroutput">Key</code>,
@@ -1055,7 +1042,7 @@
std::pair<const_iterator,const_iterator> range(
 LowerBounder lower, UpperBounder upper) const;
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">LowerBounder</code>
 and <code class="computeroutput">UpperBounder</code>
@@ -1084,21 +1071,21 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_set_of_reference___multi__set_of_views_at____info_at___and_operator_______set_of_only">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.at____info_at___and_operator_______set_of_only"></a><a 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 >
-const data_type & at(const CompatibleKey & k) const;
+const mapped_type & at(const CompatibleKey & k) const;
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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
+ Effects: Returns the <code class="computeroutput">mapped_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.
@@ -1117,16 +1104,16 @@
 and <code class="computeroutput">unconstrained_set_of</code>).
 
<a name="reference_set_of_operator_bracket_key"></a><pre class="programlisting">template< class CompatibleKey >
-data_type & operator[](const CompatibleKey & k);
+mapped_type & operator[](const CompatibleKey & k);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>
+ insert(value_type(k,mapped_type()))->second;</code>
 </li>
<li class="listitem">
 Complexity: O(log(n)).
@@ -1137,15 +1124,15 @@
 </li>
</ul></div>
<a name="reference_set_of_at_key"></a><pre class="programlisting">template< class CompatibleKey >
-data_type & at(const CompatibleKey & k);
+mapped_type & at(const CompatibleKey & k);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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
+ Effects: Returns the <code class="computeroutput">mapped_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.
@@ -1164,7 +1151,7 @@
template< class CompatibleKey >
const info_type & info_at(const CompatibleKey & k) const;
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">CompatibleKey</code>
 is a compatible key of <code class="computeroutput">key_compare</code>.
@@ -1184,7 +1171,7 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_set_of_reference___multi__set_of_views_serialization">
<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>
@@ -1203,7 +1190,7 @@
 ar.
 
</div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
 Requires: No additional requirements
 to those imposed by the container.
 </li></ul></div>
@@ -1214,7 +1201,7 @@
 archive) ar.
 
</div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: In addition to the general
 requirements, <code class="computeroutput">value_comp()</code> must be serialization-compatible
@@ -1236,7 +1223,7 @@
 an output archive (XML archive) ar.
 
</div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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.
@@ -1249,7 +1236,7 @@
 ( XML archive) ar.
 
</div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>,
@@ -1268,7 +1255,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/reference/unconstrained_set_of_reference.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/reference/unconstrained_set_of_reference.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/reference/unconstrained_set_of_reference.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_reference_unconstrained_set_of_reference">
<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>
@@ -33,12 +33,12 @@
<dt><a href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views">unconstrained_set_of
 Views</a></dt>
<dd><dl>
-<dt><a href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.complexity_signature"> Complexity
+<dt><a href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.complexity_signature">Complexity
 signature</a></dt>
<dt>Serialization</dt>
</dl></dd>
</dl></div>
-<div class="section">
+<div class="section boost_bimap_reference_unconstrained_set_of_reference_header__boost_bimap_unconstrained_set_of_hpp__synopsis">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.unconstrained_set_of_reference.header__boost_bimap_unconstrained_set_of_hpp__synopsis"></a><a 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>
@@ -53,17 +53,17 @@
struct unconstrained_set_of_relation;

-} // namespace bimap
-} // namespace boost
-</pre>
+} // namespace bimap
+} // namespace boost
+</pre>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_unconstrained_set_of_reference_unconstrained_set_of_views">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views"></a><a class="link" href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views" title="unconstrained_set_of Views">unconstrained_set_of
 Views</a>
</h4></div></div></div>
<div class="toc"><dl>
-<dt><a href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.complexity_signature"> Complexity
+<dt><a href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.complexity_signature">Complexity
 signature</a></dt>
<dt>Serialization</dt>
</dl></div>
@@ -79,13 +79,13 @@
template< -implementation defined parameter list- >
class -implementation defined view name-
{
- // Empty view
-};
+ // Empty view
+};

-} // namespace views
-} // namespace bimap
-} // namespace boost
-</pre>
+} // namespace views
+} // namespace bimap
+} // namespace boost
+</pre>

 In the case of a <code class="computeroutput">bimap< unconstrained_set_of<Left>, ... ></code>
 
@@ -99,7 +99,7 @@
 In the left map view:
 
<pre class="programlisting">typedef Left key_type;
-typedef ... data_type;
+typedef ... mapped_type;

typedef signature-compatible with std::pair< Left, ... > value_type;
</pre>
@@ -107,13 +107,13 @@
 In the right map view:
 
<pre class="programlisting">typedef ... key_type;
-typedef Left data_type;
+typedef Left mapped_type;

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

@@ -122,7 +122,7 @@
 the user, but the formulas to find the order of an operation for a bimap
 hold with the following definitions. The complexity signature of a <code class="computeroutput">unconstrained_set_of</code> view is:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 copying: <code class="computeroutput">c(n) = 0</code>
 </li>
@@ -143,7 +143,7 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_unconstrained_set_of_reference_unconstrained_set_of_views_serialization">
<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>
@@ -162,7 +162,7 @@
 ar.
 
</div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
 Requires: No additional requirements
 to those imposed by the container.
 </li></ul></div>
@@ -173,7 +173,7 @@
 archive) ar.
 
</div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
 Requires: No additional requirements
 to those imposed by the container.
 </li></ul></div>
@@ -182,7 +182,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/reference/unordered_set_of_reference.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/reference/unordered_set_of_reference.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/reference/unordered_set_of_reference.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_reference_unordered_set_of_reference">
<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>
@@ -37,7 +37,7 @@
<dt><a href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views">unordered_[multi]set_of
 Views</a></dt>
<dd><dl>
-<dt><a href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.complexity_signature"> Complexity
+<dt><a href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.complexity_signature">Complexity
 signature</a></dt>
<dt><a href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.instantiation_types">Instantiation
 types</a></dt>
@@ -54,7 +54,7 @@
<dt>Serialization</dt>
</dl></dd>
</dl></div>
-<div class="section">
+<div class="section boost_bimap_reference_unordered_set_of_reference_header__boost_bimap_unordered_set_of_hpp__synopsis">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.unordered_set_of_reference.header__boost_bimap_unordered_set_of_hpp__synopsis"></a><a 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>
@@ -80,11 +80,11 @@
struct unordered_set_of_relation;

-} // namespace bimap
-} // namespace boost
-</pre>
+} // namespace bimap
+} // namespace boost
+</pre>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_unordered_set_of_reference_header__boost_bimap_unordered_multiset_of_hpp__synopsis">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.unordered_set_of_reference.header__boost_bimap_unordered_multiset_of_hpp__synopsis"></a><a 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>
@@ -110,11 +110,11 @@
struct unordered_multiset_of_relation;

-} // namespace bimap
-} // namespace boost
-</pre>
+} // namespace bimap
+} // namespace boost
+</pre>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_unordered_set_of_reference_collection_type_specifiers_unordered_set_of_and_unordered_multiset_of">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.unordered_set_of_reference.collection_type_specifiers_unordered_set_of_and_unordered_multiset_of"></a><a 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,13 +125,13 @@
 coincide, thus we describe them in a grouped manner.
 
</div>
-<div class="section">
+<div class="section boost_bimap_reference_unordered_set_of_reference_unordered___multi__set_of_views">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views" title="unordered_[multi]set_of Views">unordered_[multi]set_of
 Views</a>
</h4></div></div></div>
<div class="toc"><dl>
-<dt><a href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.complexity_signature"> Complexity
+<dt><a href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.complexity_signature">Complexity
 signature</a></dt>
<dt><a href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.instantiation_types">Instantiation
 types</a></dt>
@@ -191,8 +191,8 @@
{
 public:

- // types
-
+ // types
+
 typedef -unspecified- key_type;
 typedef -unspecified- value_type;
 typedef -unspecified- key_compare;
@@ -213,27 +213,27 @@

 typedef -unspecified- info_type;

- // construct/destroy/copy:
-
+ // construct/destroy/copy:
+
 this_type & operator=(const this_type & x);

 allocator_type get_allocator() const;

- // size and capacity
-
+ // size and capacity
+
 bool empty() const;
 size_type size() const;
 size_type max_size() const;

- // iterators
-
+ // iterators
+
 iterator begin();
 const_iterator begin() const;
 iterator end();
 const_iterator end() const;

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

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

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

- // Only in map views
- // {
-
+ // Only in map views
+ // {
+
+ typedef -unspecified- mapped_type;
+ typedef -unspecified- data_type; // Equal to mapped_type
+
 template< class CompatibleKey >
 bool <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_replace_key_iterator_key">replace_key</a>(iterator position, const CompatibleKey & x);

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

- // }
-
+ // }
+

 void clear();

- // observers
-
+ // observers
+
 key_from_value key_extractor() const;
 hasher hash_function() const;
 key_equal key_eq() const;

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

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

- // bucket interface
-
+ // bucket interface
+
 size_type bucket_count() const;
 size_type max_bucket_count() const;
 size_type bucket_size(size_type n) const;
@@ -307,54 +310,54 @@
 local_iterator end(size_type n);
 const_local_iterator end(size_type n) const;

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

- // Only in maps views
- // {
-
- typedef -unspecified- data_type;
-
- // Only in for `unordered_set_of` collection type
- // {
-
+ // Only in maps views
+ // {
+
+ typedef -unspecified- mapped_type;
+
+ // Only in for `unordered_set_of` collection type
+ // {
+
 template<class CompatibleKey>
- const data_type & <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_at_key_const">at</a>(const CompatibleKey & k) const;
+ const mapped_type & <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_at_key_const">at</a>(const CompatibleKey & k) const;
+
+ // Only if the other collection type is mutable
+ // {

- // Only if the other collection type is mutable
- // {
-
 template<class CompatibleKey>
- data_type & <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_operator_bracket_key">operator[]</a>(const CompatibleKey & k);
+ mapped_type & <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_operator_bracket_key">operator[]</a>(const CompatibleKey & k);

 template<class CompatibleKey>
- data_type & <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_at_key">at</a>(const CompatibleKey & k);
+ mapped_type & <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_at_key">at</a>(const CompatibleKey & k);
+
+ // }
+
+ // Only if info_hook is used
+ // {

- // }
-
- // Only if info_hook is used
- // {
-
 template< class CompatibleKey >
 info_type & <a class="link" href="unordered_set_of_reference.html#reference_unordered_set_of_info_at_key">info_at</a>(const CompatibleKey & k);

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

- // }
-
- // }
-
+ // }
+
+ // }
+
};

-} // namespace views
-} // namespace bimap
-} // namespace boost
-</pre>
+} // namespace views
+} // namespace bimap
+} // namespace boost
+</pre>

 In the case of a <code class="computeroutput">bimap< unordered_{multi}set_of<Left>, ... ></code>
 
@@ -368,7 +371,7 @@
 In the left map view:
 
<pre class="programlisting">typedef Left key_type;
-typedef ... data_type;
+typedef ... mapped_type;

typedef signature-compatible with std::pair< const Left, ... > value_type;
</pre>
@@ -376,13 +379,13 @@
 In the right map view:
 
<pre class="programlisting">typedef ... key_type;
-typedef Left data_type;
+typedef Left mapped_type;

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

@@ -391,7 +394,7 @@
 signature section</a>. The complexity signature of <code class="computeroutput">unordered_[multi]set_of</code>
 view is:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 copying: <code class="computeroutput">c(n) = n * log(n)</code>,
 </li>
@@ -405,29 +408,27 @@
 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">
+ <div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: circle; ">
<li class="listitem">
- if the new element key is equivalent to the original, <code class="computeroutput">r(n)
- = 1</code>
- (constant),
- </li>
-<li class="listitem">
- otherwise, average case <code class="computeroutput">r(n) =
- 1</code> (constant), worst case
- <code class="computeroutput">r(n)
- = n</code>,
- </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>
</ul></div>
-</li>
+ </li>
<li class="listitem">
 modifying: average case <code class="computeroutput">m(n) = 1</code> (constant), worst case <code class="computeroutput">m(n) = n</code>.
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_unordered_set_of_reference_unordered___multi__set_of_views_instantiation_types">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.instantiation_types"></a><a 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,7 +439,7 @@
 means of the collection type specifiers and the <code class="computeroutput">bimap</code>
 itself. Instantiations are dependent on the following types:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 <code class="computeroutput">Value</code> from <code class="computeroutput">bimap</code>,
 </li>
@@ -464,7 +465,7 @@
 same value for keys equivalent under <code class="computeroutput">Pred</code>.
 
</div>
-<div class="section">
+<div class="section boost_bimap_reference_unordered_set_of_reference_unordered___multi__set_of_views_nested_types">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.nested_types"></a><a 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>
@@ -479,7 +480,7 @@
 Iterator</a>.
 </blockquote></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_unordered_set_of_reference_unordered___multi__set_of_views_constructors__copy_and_assignment">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.constructors__copy_and_assignment"></a><a 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>
@@ -492,7 +493,7 @@
 
<pre class="programlisting">this_type & operator=(const this_type & x);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Effects: <code class="computeroutput">a
 = b</code>;
@@ -505,29 +506,27 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_unordered_set_of_reference_unordered___multi__set_of_views_modifiers">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.modifiers"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.modifiers" title="Modifiers">Modifiers</a>
</h5></div></div></div>
<a name="reference_unordered_set_of_insert_value"></a><pre class="programlisting">std::pair<iterator,bool> insert(const value_type & x);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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">
+ <div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>
@@ -546,28 +545,26 @@
</ul></div>
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 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">
+ <div class="itemizedlist"><ul class="itemizedlist" style="list-style-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
@@ -585,7 +582,7 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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
@@ -616,7 +613,7 @@
</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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">position</code>
 is a valid dereferenceable <code class="computeroutput">iterator</code>
@@ -643,7 +640,7 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Effects: Deletes the elements with
 key equivalent to <code class="computeroutput">x</code>.
@@ -662,7 +659,7 @@
</ul></div>
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">[first,last)</code>
 is a valid range of the view.
@@ -684,29 +681,27 @@
</ul></div>
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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: 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">
+ <div class="itemizedlist"><ul class="itemizedlist" style="list-style-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.
@@ -729,30 +724,28 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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">
+ <div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>
+ 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>
+ 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.
@@ -775,30 +768,28 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>.
+ <code class="computeroutput">mapped_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">
+ <div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>
+ 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>
+ 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.
@@ -821,7 +812,7 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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
@@ -829,23 +820,21 @@
 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">
+ <div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: circle; ">
<li class="listitem">
- the map view is non-unique OR no other element with equivalent
- key exists,
- </li>
+ 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>
+ AND rearrangement is allowed by all other views of the <code class="computeroutput">bimap</code>.
+ </li>
</ul></div>
-</li>
+ </li>
<li class="listitem">
 Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
 succeeds.
@@ -871,31 +860,29 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>
+ Function</a> accepting arguments of type: <code class="computeroutput">mapped_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">
+ <div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: circle; ">
<li class="listitem">
- the oppositte map view is non-unique OR no other element with
- equivalent key in that view exists,
- </li>
+ 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>
+ AND rearrangement is allowed by all other views of the <code class="computeroutput">bimap</code>.
+ </li>
</ul></div>
-</li>
+ </li>
<li class="listitem">
 Postconditions: Validity of <code class="computeroutput">position</code> is preserved if the operation
 succeeds.
@@ -919,7 +906,7 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_unordered_set_of_reference_unordered___multi__set_of_views_lookup">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.lookup"></a><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>
@@ -951,7 +938,7 @@
template< class CompatibleKey >
const_iterator find(const CompatibleKey & x) const;
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Effects: Returns a pointer to an
 element whose key is equivalent to <code class="computeroutput">x</code>,
@@ -966,7 +953,7 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Effects: Returns the number of elements
 with key equivalent to <code class="computeroutput">x</code>.
@@ -984,7 +971,7 @@
std::pair<const_iterator,const_iterator>
 equal_range(const CompatibleKey & x) const;
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Effects: Returns a range containing
 all elements with keys equivalent to <code class="computeroutput">x</code>
@@ -996,21 +983,21 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_unordered_set_of_reference_unordered___multi__set_of_views_at____info_at___and_operator_______set_of_only">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.at____info_at___and_operator_______set_of_only"></a><a 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 >
-const data_type & at(const CompatibleKey & k) const;
+const mapped_type & at(const CompatibleKey & k) const;
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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
+ Effects: Returns the <code class="computeroutput">mapped_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.
@@ -1030,16 +1017,16 @@
 and <code class="computeroutput">unconstrained_set_of</code>).
 
<a name="reference_unordered_set_of_operator_bracket_key"></a><pre class="programlisting">template< class CompatibleKey >
-data_type & operator[](const CompatibleKey & k);
+mapped_type & operator[](const CompatibleKey & k);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>
+ insert(value_type(k,mapped_type()))->second;</code>
 </li>
<li class="listitem">
 Complexity: If the insertion is
@@ -1052,15 +1039,15 @@
 </li>
</ul></div>
<a name="reference_unordered_set_of_at_key"></a><pre class="programlisting">template< class CompatibleKey >
-data_type & at(const CompatibleKey & k);
+mapped_type & at(const CompatibleKey & k);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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
+ Effects: Returns the <code class="computeroutput">mapped_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.
@@ -1080,7 +1067,7 @@
template< class CompatibleKey >
const info_type & info_at(const CompatibleKey & k) const;
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">CompatibleKey</code>
 is a compatible key of <code class="computeroutput">key_compare</code>.
@@ -1100,14 +1087,14 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_unordered_set_of_reference_unordered___multi__set_of_views_hash_policy">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.hash_policy"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.hash_policy" title="Hash policy">Hash
 policy</a>
</h5></div></div></div>
<a name="reference_unordered_set_of_rehash_size"></a><pre class="programlisting">void rehash(size_type n);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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
@@ -1126,7 +1113,7 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_unordered_set_of_reference_unordered___multi__set_of_views_serialization">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.serialization"></a><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>
@@ -1143,7 +1130,7 @@
 ar.
 
</div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
 Requires: No additional requirements
 to those imposed by the container.
 </li></ul></div>
@@ -1154,7 +1141,7 @@
 archive) ar.
 
</div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: Additionally to the general
 requirements, <code class="computeroutput">key_eq()</code> must be serialization-compatible
@@ -1177,7 +1164,7 @@
 (XML archive) ar.
 
</div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>
@@ -1191,7 +1178,7 @@
 from an input archive (XML archive) ar.
 
</div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Postconditions: On successful loading,
 if <code class="computeroutput">it</code> was dereferenceable
@@ -1212,7 +1199,7 @@
 or const_local_iterator it to an output archive (XML archive) ar.
 
</div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>
@@ -1224,7 +1211,7 @@
 (XML archive) ar.
 
</div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Postconditions: On successful loading,
 if <code class="computeroutput">it</code> was dereferenceable
@@ -1250,7 +1237,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/reference/vector_of_reference.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/reference/vector_of_reference.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/reference/vector_of_reference.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_reference_vector_of_reference">
<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>
@@ -33,7 +33,7 @@
<dt><a href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views">vector_of
 views</a></dt>
<dd><dl>
-<dt><a href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.complexity_signature"> Complexity
+<dt><a href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.complexity_signature">Complexity
 signature</a></dt>
<dt><a href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.instantiation_types">Instantiation
 types</a></dt>
@@ -49,7 +49,7 @@
<dt>Serialization</dt>
</dl></dd>
</dl></div>
-<div class="section">
+<div class="section boost_bimap_reference_vector_of_reference_header__boost_bimap_vector_of_hpp__synopsis">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.vector_of_reference.header__boost_bimap_vector_of_hpp__synopsis"></a><a 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>
@@ -64,17 +64,17 @@
struct vector_of_relation;

-} // namespace bimap
-} // namespace boost
-</pre>
+} // namespace bimap
+} // namespace boost
+</pre>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_vector_of_reference_vector_of_views">
<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>
</h4></div></div></div>
<div class="toc"><dl>
-<dt><a href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.complexity_signature"> Complexity
+<dt><a href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.complexity_signature">Complexity
 signature</a></dt>
<dt><a href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.instantiation_types">Instantiation
 types</a></dt>
@@ -107,7 +107,7 @@
 As is the case with list_of views, vector_of views have the following limitations
 with respect to STL sequence containers:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 vector_of views are not Assignable
 (like any other view.)
@@ -142,8 +142,8 @@
{
 public:

- // types
-
+ // types
+
 typedef -unspecified- value_type;
 typedef -unspecified- allocator_type;
 typedef -unspecified- reference;
@@ -159,8 +159,8 @@

 typedef -unspecified- info_type;

- // construct / copy / destroy
-
+ // construct / copy / destroy
+
 this_type & operator=(this_type & x);

 template< class InputIterator >
@@ -170,8 +170,8 @@

 allocator_type get_allocator() const;

- // iterators
-
+ // iterators
+
 iterator begin();
 const_iterator begin() const;

@@ -184,8 +184,8 @@
 reverse_iterator rend();
 const_reverse_iterator rend() const;

- // capacity
-
+ // capacity
+
 bool empty() const;

 size_type size() const;
@@ -198,8 +198,8 @@

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

- // access
-
+ // access
+
 const_reference operator[](size_type n) const;

 const_reference at(size_type n) const;
@@ -208,8 +208,8 @@

 const_reference back() const;

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

@@ -228,9 +228,12 @@

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

- // Only in map views
- // {
-
+ // Only in map views
+ // {
+ typedef -unspecified- key_type;
+ typedef -unspecified- mapped_type;
+ typedef -unspecified- data_type; // Equal to mapped_type
+
 template< class CompatibleKey >
 bool <a class="link" href="vector_of_reference.html#reference_vector_of_replace_key_iterator_key">replace_key</a>(iterator position, const CompatibleKey & x);

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

- // }
-
+ // }
+

 void clear();

- // list operations
-
+ // list operations
+
 void <a class="link" href="vector_of_reference.html#reference_vector_of_splice_iterator_this">splice</a>(iterator position, this_type & x);
 void <a class="link" href="vector_of_reference.html#reference_vector_of_splice_iterator_this_iterator">splice</a>(iterator position, this_type & x, iterator i);
 void <a class="link" href="vector_of_reference.html#reference_vector_of_splice_iterator_this_iterator_iterator">splice</a>(
@@ -277,14 +280,14 @@

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

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

-// view comparison
-
+// view comparison
+
bool operator==(const this_type & v1, const this_type & v2 );
bool operator< (const this_type & v1, const this_type & v2 );
bool operator!=(const this_type & v1, const this_type & v2 );
@@ -292,10 +295,10 @@
bool operator>=(const this_type & v1, const this_type & v2 );
bool operator<=(const this_type & v1, const this_type & v2 );

-} // namespace views
-} // namespace bimap
-} // namespace boost
-</pre>
+} // namespace views
+} // namespace bimap
+} // namespace boost
+</pre>

 In the case of a <code class="computeroutput">bimap< vector_of<Left>, ... ></code>
 
@@ -309,7 +312,7 @@
 In the left map view:
 
<pre class="programlisting">typedef Left key_type;
-typedef ... data_type;
+typedef ... mapped_type;

typedef signature-compatible with std::pair< Left, ... > value_type;
</pre>
@@ -317,13 +320,13 @@
 In the right map view:
 
<pre class="programlisting">typedef ... key_type;
-typedef Left data_type;
+typedef Left mapped_type;

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

@@ -332,7 +335,7 @@
 signature section</a>. The complexity signature of <code class="computeroutput">vector_of</code>
 view is:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 copying: <code class="computeroutput">c(n) = n * log(n)</code>,
 </li>
@@ -375,7 +378,7 @@
 and relocate, respectively.)
 
</div>
-<div class="section">
+<div class="section boost_bimap_reference_vector_of_reference_vector_of_views_instantiation_types">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.vector_of_reference.vector_of_views.instantiation_types"></a><a class="link" href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.instantiation_types" title="Instantiation types">Instantiation
 types</a>
@@ -386,7 +389,7 @@
 specified by means of the collection type specifiers and the bimap itself.
 Instantiations are dependent on the following types:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 <code class="computeroutput">Value</code> from <code class="computeroutput">vector_of</code>,
 </li>
@@ -395,7 +398,7 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_vector_of_reference_vector_of_views_constructors__copy_and_assignment">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.vector_of_reference.vector_of_views.constructors__copy_and_assignment"></a><a 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>
@@ -406,7 +409,7 @@
 
<pre class="programlisting">this_type & operator=(const this_type & x);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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.
@@ -418,7 +421,7 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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
@@ -435,7 +438,7 @@
</ul></div>
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
 Effects: <code class="computeroutput">clear(); for(size_type
 i =
 0;
@@ -444,14 +447,14 @@
 ++n) push_back(v);</code>
 </li></ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_vector_of_reference_vector_of_views_capacity_operations">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.vector_of_reference.vector_of_views.capacity_operations"></a><a class="link" href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.capacity_operations" title="Capacity operations">Capacity
 operations</a>
</h5></div></div></div>
<a name="reference_vector_of_capacity"></a><pre class="programlisting">size_type capacity() const;
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Returns: The total number of elements
 <code class="computeroutput">c</code> such that, when
@@ -468,7 +471,7 @@
</ul></div>
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Effects: If the previous value of
 <code class="computeroutput">capacity()</code>
@@ -487,7 +490,7 @@
</ul></div>
<a name="reference_vector_of_resize_size_value"></a><pre class="programlisting">void resize(size_type n, const value_type & x = value_type());
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Effects: <code class="computeroutput">if( n > size() ) insert(end(),
 n-size(),
@@ -501,13 +504,13 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_vector_of_reference_vector_of_views_modifiers">
<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);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>
@@ -531,7 +534,7 @@
</ul></div>
<a name="reference_vector_of_push_back_value"></a><pre class="programlisting">std::pair<iterator,bool> push_back(const value_type & x);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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.
@@ -554,7 +557,7 @@
</ul></div>
<a name="reference_vector_of_insert_iterator_value"></a><pre class="programlisting">std::pair<iterator,bool> insert(iterator position, const value_type & x);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view.
@@ -582,7 +585,7 @@
</ul></div>
<a name="reference_vector_of_insert_iterator_size_value"></a><pre class="programlisting">void insert(iterator position, size_type m, const value_type & x);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view.
@@ -603,7 +606,7 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view. <code class="computeroutput">InputIterator</code>
@@ -629,7 +632,7 @@
</ul></div>
<a name="reference_vector_of_erase_iterator"></a><pre class="programlisting">iterator erase(iterator position);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">position</code>
 is a valid dereferenceable iterator of the view.
@@ -653,7 +656,7 @@
</ul></div>
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">[first,last)</code>
 is a valid range of the view.
@@ -675,7 +678,7 @@
</ul></div>
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">position</code>
 is a valid dereferenceable iterator of the view.
@@ -708,7 +711,7 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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
@@ -744,11 +747,11 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>.
+ <code class="computeroutput">mapped_type</code>.
 </li>
<li class="listitem">
 Effects: Assigns the value <code class="computeroutput">x</code> to <code class="computeroutput">e.second</code>,
@@ -780,7 +783,7 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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
@@ -819,11 +822,11 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>
+ Function</a> accepting arguments of type: <code class="computeroutput">mapped_type&</code>; <code class="computeroutput">position</code>
 is a valid dereferenceable iterator of the view.
 </li>
<li class="listitem">
@@ -856,7 +859,7 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_vector_of_reference_vector_of_views_list_operations">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.vector_of_reference.vector_of_views.list_operations"></a><a class="link" href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.list_operations" title="List operations">List
 operations</a>
@@ -870,7 +873,7 @@
 
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view. <code class="computeroutput">&x!=this</code>.
@@ -891,7 +894,7 @@
</ul></div>
<a name="reference_vector_of_splice_iterator_this_iterator"></a><pre class="programlisting">void splice(iterator position, this_type & x,iterator i);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view. <code class="computeroutput">i</code>
@@ -922,7 +925,7 @@
</ul></div>
<a name="reference_vector_of_splice_iterator_this_iterator_iterator"></a><pre class="programlisting">void splice(iterator position, this_type & x, iterator first, iterator last);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view. <code class="computeroutput">first</code>
@@ -955,7 +958,7 @@
</ul></div>
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Effects: Erases all elements of
 the view which compare equal to <code class="computeroutput">value</code>.
@@ -971,7 +974,7 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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.
@@ -986,7 +989,7 @@
</ul></div>
<a name="reference_vector_of_unique"></a><pre class="programlisting">void unique();
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Effects: Eliminates all but the
 first element from every consecutive group of equal elements referred
@@ -1002,9 +1005,9 @@
 </li>
</ul></div>
<a name="reference_vector_of_unique_predicate"></a><pre class="programlisting">template< class BinaryPredicate >
-void unique(BinaryPredicate binary_pred);
+void unique(BinaryPredicate binary_pred);
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Effects: Eliminates all but the
 first element from every consecutive group of elements referred to
@@ -1022,7 +1025,7 @@
</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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>.
@@ -1056,7 +1059,7 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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
@@ -1093,7 +1096,7 @@
</ul></div>
<a name="reference_vector_of_sort"></a><pre class="programlisting">void sort();
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>.
@@ -1118,7 +1121,7 @@
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>.
@@ -1141,7 +1144,7 @@
</ul></div>
<a name="reference_vector_of_reverse"></a><pre class="programlisting">void reverse();
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Effects: Reverses the order of the
 elements in the view.
@@ -1158,7 +1161,7 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_vector_of_reference_vector_of_views_rearrange_operations">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.vector_of_reference.vector_of_views.rearrange_operations"></a><a class="link" href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.rearrange_operations" title="Rearrange operations">Rearrange
 operations</a>
@@ -1170,7 +1173,7 @@
 
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view. <code class="computeroutput">i</code>
@@ -1194,7 +1197,7 @@
</ul></div>
<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">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: <code class="computeroutput">position</code>
 is a valid iterator of the view. <code class="computeroutput">first</code>
@@ -1220,7 +1223,7 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_reference_vector_of_reference_vector_of_views_serialization">
<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>
@@ -1239,7 +1242,7 @@
 ar.
 
</div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
 Requires: No additional requirements
 to those imposed by the container.
 </li></ul></div>
@@ -1250,7 +1253,7 @@
 archive) ar.
 
</div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Requires: No additional requirements
 to those imposed by the container.
@@ -1272,7 +1275,7 @@
 (XML archive) ar.
 
</div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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.
@@ -1285,7 +1288,7 @@
 (XML archive) ar.
 
</div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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>,
@@ -1303,7 +1306,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/release_notes.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/release_notes.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/release_notes.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,17 +22,82 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_release_notes">
<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>
-
- Not yet released.
- 
+<h4>
+<a name="boost_bimap.release_notes.h0"></a>
+ <a name="boost_bimap.release_notes.boost_1_53_release"></a><a class="link" href="release_notes.html#boost_bimap.release_notes.boost_1_53_release">Boost
+ 1.53 release</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+ Refactor map_view_iterator to improve error messages.
+ </li>
+<li class="listitem">
+ Fixed replace_(left/right/key/data) bug when using relations with info.
+ </li>
+<li class="listitem">
+ Fixed vector_of and list_of views <code class="computeroutput">assign(size_type,value_type)</code> bug.
+ </li>
+<li class="listitem">
+ Fixed vector_of views <code class="computeroutput">operator[](size_type)</code> and <code class="computeroutput">at(size_type)</code> functions return value.
+ </li>
+</ul></div>
+<h4>
+<a name="boost_bimap.release_notes.h1"></a>
+ <a name="boost_bimap.release_notes.boost_1_52_release"></a><a class="link" href="release_notes.html#boost_bimap.release_notes.boost_1_52_release">Boost
+ 1.52 release</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
+ Fixed unused parameter name warnings in Boost.Bimap (#7425).
+ </li></ul></div>
+<h4>
+<a name="boost_bimap.release_notes.h2"></a>
+ <a name="boost_bimap.release_notes.boost_1_50_release"></a><a class="link" href="release_notes.html#boost_bimap.release_notes.boost_1_50_release">Boost
+ 1.50 release</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+ Added key_type and mapped_type (leaving data_type for backward compatibility)
+ typedefs to map views (#6031).
+ </li>
+<li class="listitem">
+ Removed spurious dependency on Boost.Serialization (#3868).
+ </li>
+<li class="listitem">
+ Solved unused constructor parameter warning (#5749).
+ </li>
+</ul></div>
+<h4>
+<a name="boost_bimap.release_notes.h3"></a>
+ <a name="boost_bimap.release_notes.boost_1_45_release"></a><a class="link" href="release_notes.html#boost_bimap.release_notes.boost_1_45_release">Boost
+ 1.45 release</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+ Fixed custom allocators (#3665).
+ </li>
+<li class="listitem">
+ Fixed count() constness (#2484).
+ </li>
+<li class="listitem">
+ Other maintenance fixes.
+ </li>
+</ul></div>
+<h4>
+<a name="boost_bimap.release_notes.h4"></a>
+ <a name="boost_bimap.release_notes.boost_1_35_release"></a><a class="link" href="release_notes.html#boost_bimap.release_notes.boost_1_35_release">Boost
+ 1.35 release</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
+ Added to Boost Libraries.
+ </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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/test_suite.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/test_suite.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/test_suite.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_test_suite">
<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>
@@ -445,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_the_tutorial">
<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,7 +84,7 @@
<dt><a href="the_tutorial/complete_instantiation_scheme.html">Complete
 instantiation scheme</a></dt>
</dl></div>
-<div class="section">
+<div class="section boost_bimap_the_tutorial_roadmap">
<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>
@@ -146,7 +146,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/additional_information.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/additional_information.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/additional_information.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_the_tutorial_additional_information">
<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,13 +32,12 @@
 we want to represent a books and author bidirectional map.
 

-

<pre class="programlisting">typedef bimap<

- multiset_of< std::string >, // author
- set_of< std::string > // title
-
+ multiset_of< std::string >, // author
+ set_of< std::string > // title
+
> bm_type;
typedef bm_type::value_type book;

@@ -48,8 +47,8 @@
bm.insert( book( "Scott Meyers" , "Effective C++" ) );
bm.insert( book( "Andrei Alexandrescu" , "Modern C++ Design" ) );

-// Print the author of Modern C++
-std::cout << bm.right.at( "Modern C++ Design" );
+// Print the author of Modern C++
+std::cout << bm.right.at( "Modern C++ Design" );
</pre>

 
@@ -101,15 +100,14 @@
 constructor.
 

-

<pre class="programlisting">typedef bimap<

- multiset_of< std::string >, // author
- set_of< std::string >, // title
-
- with_info< std::string > // abstract
-
+ multiset_of< std::string >, // author
+ set_of< std::string >, // title
+
+ with_info< std::string > // abstract
+
> bm_type;
typedef bm_type::value_type book;

@@ -124,11 +122,11 @@
);

-// Print the author of the bible
-std::cout << bm.right.at("The C++ Programming Language");
+// Print the author of the bible
+std::cout << bm.right.at("The C++ Programming Language");

-// Print the abstract of this book
-bm_type::left_iterator i = bm.left.find("Bjarne Stroustrup");
+// Print the abstract of this book
+bm_type::left_iterator i = bm.left.find("Bjarne Stroustrup");
std::cout << i->info;
</pre>

@@ -137,7 +135,6 @@
 Contrary to the two key types, the information will be mutable using iterators.
 

-

<pre class="programlisting">i->info += "More details about this book";
</pre>
@@ -149,10 +146,9 @@
 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 class="programlisting">// Print the new abstract
+std::cout << bm.right.info_at("The C++ Programming Language");
</pre>

 
@@ -161,7 +157,6 @@
 is a rewrite of the above example using user defined names:
 

-

<pre class="programlisting">typedef bimap<

@@ -183,20 +178,20 @@
 "the one that started it all—the font of our knowledge." )
);

-// Print the author of the bible
-std::cout << bm.by<title>().at("The C++ Programming Language");
+// Print the author of the bible
+std::cout << bm.by<title>().at("The C++ Programming Language");

-// Print the abstract of this book
-bm_type::map_by<author>::iterator i = bm.by<author>().find("Bjarne Stroustrup");
+// Print the abstract of this book
+bm_type::map_by<author>::iterator i = bm.by<author>().find("Bjarne Stroustrup");
std::cout << i->get<abstract>();

-// Contrary to the two key types, the information will be mutable
-// using iterators.
-
+// Contrary to the two key types, the information will be mutable
+// using iterators.
+
i->get<abstract>() += "More details about this book";

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

 
@@ -206,7 +201,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/bimaps_with_user_defined_names.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/bimaps_with_user_defined_names.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/bimaps_with_user_defined_names.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_the_tutorial_bimaps_with_user_defined_names">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.the_tutorial.bimaps_with_user_defined_names"></a><a class="link" href="bimaps_with_user_defined_names.html" title="Bimaps with user defined names">Bimaps
 with user defined names</a>
@@ -35,7 +35,6 @@
 <a href="../../../../example/user_defined_names.cpp" target="_top">Go to source code</a>
 

-

<pre class="programlisting">typedef bimap
<
@@ -46,19 +45,19 @@

People people;

-// ...
-
+// ...
+
int user_id;
std::cin >> user_id;

-// people.right : map<id,name>
-
+// people.right : map<id,name>
+
People::right_const_iterator id_iter = people.right.find(user_id);
if( id_iter != people.right.end() )
{
- // first : id
- // second : name
-
+ // first : id
+ // second : name
+
 std::cout << "name: " << id_iter->second << std::endl
 << "id: " << id_iter->first << std::endl;
}
@@ -66,17 +65,17 @@
{
 std::cout << "Unknown id, users are:" << std::endl;

- // people.left : map<name,id>
-
+ // people.left : map<name,id>
+
 for( People::left_const_iterator
 name_iter = people.left.begin(),
 iend = people.left.end();

 name_iter != iend; ++name_iter )
 {
- // first : name
- // second : id
-
+ // first : name
+ // second : id
+
 std::cout << "name: " << name_iter->first << std::endl
 << "id: " << name_iter->second << std::endl;
 }
@@ -110,11 +109,10 @@
 <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
-
+<pre class="programlisting">struct id {}; // Tag for the identification number
+struct name {}; // Tag for the name of the person
+
typedef bimap
<
 tagged< int , id > ,
@@ -124,8 +122,8 @@

People people;

-// ...
-
+// ...
+
int user_id;
std::cin >> user_id;

@@ -159,21 +157,21 @@
 
<pre class="programlisting">struct Left {};
struct Right {};
-typedef bimap<
+typedef bimap<
 multiset_of< tagged< int, Left > >,
 unordered_set_of< tagged< int, Right > >
> bm_type;

bm_type bm;

-//...
-
+//...
+
bm_type::iterator iter = bm.begin();
bm_type::left_iterator left_iter = bm.left.begin();
bm_type::right_iterator right_iter = bm.right.begin();
</pre>
<div class="table">
-<a name="id792238"></a>Table 1.3. Equivalence of expresions using user defined names
+<a name="boost_bimap.the_tutorial.bimaps_with_user_defined_names.t0"></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>
@@ -367,7 +365,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/complete_instantiation_scheme.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/complete_instantiation_scheme.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/complete_instantiation_scheme.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_the_tutorial_complete_instantiation_scheme">
<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>
@@ -34,10 +34,10 @@
<
 LeftCollectionType, RightCollectionType

- [ , SetTypeOfRelation ] // Default to left_based
- [ , with_info< Info > ] // Default to no info
- [ , Allocator ] // Default to std::allocator<>
-
+ [ , SetTypeOfRelation ] // Default to left_based
+ [ , with_info< Info > ] // Default to no info
+ [ , Allocator ] // Default to std::allocator<>
+
> bm;
</pre>

@@ -51,7 +51,7 @@
 
<pre class="programlisting">bimap< Type, R >
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Left type: <code class="computeroutput">Type</code>
 </li>
@@ -65,7 +65,7 @@
</ul></div>
<pre class="programlisting">bimap< {CollectionType}_of< Type >, R >
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Left type: <code class="computeroutput">Type</code>
 </li>
@@ -78,7 +78,7 @@
</ul></div>
<pre class="programlisting">bimap< tagged< Type, Tag >, R >
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Left type: <code class="computeroutput">Type</code>
 </li>
@@ -92,7 +92,7 @@
</ul></div>
<pre class="programlisting">bimap< {CollectionType}_of< tagged< Type, Tag > >, R >
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 Left type: <code class="computeroutput">Type</code>
 </li>
@@ -124,7 +124,7 @@
 
<pre class="programlisting">bimap< L, R >
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 set_of_relation_type: based on the left key type
 </li>
@@ -137,7 +137,7 @@
</ul></div>
<pre class="programlisting">bimap< L, R ,SetOfRelationType>
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 set_of_relation_type: SetOfRelationType
 </li>
@@ -150,7 +150,7 @@
</ul></div>
<pre class="programlisting">bimap< L, R , SetOfRelationType, with_info<Info> >
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 set_of_relation_type: SetOfRelationType
 </li>
@@ -163,7 +163,7 @@
</ul></div>
<pre class="programlisting">bimap< L, R , SetOfRelationType, with_info<Info>, Allocator>
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 set_of_relation_type: SetOfRelationType
 </li>
@@ -176,7 +176,7 @@
</ul></div>
<pre class="programlisting">bimap< L, R , SetOfRelationType, Allocator>
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 set_of_relation_type: SetOfRelationType
 </li>
@@ -189,7 +189,7 @@
</ul></div>
<pre class="programlisting">bimap< L, R , with_info<Info> >
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 set_of_relation_type: based on the left key type
 </li>
@@ -202,7 +202,7 @@
</ul></div>
<pre class="programlisting">bimap< L, R , with_info<Info>, Allocator>
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 set_of_relation_type: based on the left key type
 </li>
@@ -212,7 +212,7 @@
</ul></div>
<pre class="programlisting">bimap< L, R , Allocator>
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 set_of_relation_type: based on the left key type
 </li>
@@ -226,7 +226,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/controlling_collection_types.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/controlling_collection_types.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/controlling_collection_types.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_the_tutorial_controlling_collection_types">
<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">
+<div class="section boost_bimap_the_tutorial_controlling_collection_types_freedom_of_choice">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.the_tutorial.controlling_collection_types.freedom_of_choice"></a><a 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="id776404"></a>Table 1.2. Collection of Key Types
+<a name="boost_bimap.the_tutorial.controlling_collection_types.freedom_of_choice.t0"></a>Table 1.2. Collection of Key Types
<div class="table-contents"><table class="table" summary="Collection of Key Types">
<colgroup>
<col>
@@ -227,7 +227,7 @@
 The following now describes the resulting map views of the bidirectional
 map.
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 <code class="computeroutput">bm.left</code> is signature-compatible with
 LeftMapType<code class="computeroutput"><A,B></code>
@@ -238,7 +238,7 @@
 </li>
</ul></div>
</div>
-<div class="section">
+<div class="section boost_bimap_the_tutorial_controlling_collection_types_configuration_parameters">
<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>
@@ -348,13 +348,13 @@
</tbody>
</table></div>
</div>
-<div class="section">
+<div class="section boost_bimap_the_tutorial_controlling_collection_types_examples">
<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="id777500"></a>
- <a class="link" href="controlling_collection_types.html#boost_bimap.the_tutorial.controlling_collection_types.examples.countries_populations">Countries
+<h6>
+<a name="boost_bimap.the_tutorial.controlling_collection_types.examples.h0"></a>
+ <a name="boost_bimap.the_tutorial.controlling_collection_types.examples.countries_populations"></a><a class="link" href="controlling_collection_types.html#boost_bimap.the_tutorial.controlling_collection_types.examples.countries_populations">Countries
 Populations</a>
 </h6>

@@ -395,7 +395,6 @@
 <a href="../../../../example/population_bimap.cpp" target="_top">Go to source code</a>
 

-

<pre class="programlisting">typedef bimap<

@@ -416,38 +415,38 @@

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
+// First requirement
+<a class="co" name="boost_bimap.the_tutorial.controlling_collection_types.examples.c0" href="controlling_collection_types.html#boost_bimap.the_tutorial.controlling_collection_types.examples.c1"><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 )
{
 std::cout << i->second << " with " << i->first << std::endl;
}

-// 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;
+// Second requirement
+<a class="co" name="boost_bimap.the_tutorial.controlling_collection_types.examples.c2" href="controlling_collection_types.html#boost_bimap.the_tutorial.controlling_collection_types.examples.c3"><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 width="5%" valign="top" align="left"><a name="boost_bimap.the_tutorial.controlling_collection_types.examples.c1"></a> </td>
<td valign="top" align="left">
 The right map view works like a <code class="computeroutput">std::multimap< long, std::string, std::greater<long> ></code>,
 We can iterate over it to print the results in the required order.
 </td>
</tr>
<tr>
-<td width="5%" valign="top" align="left"><a name="boost_bimap5"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap.the_tutorial.controlling_collection_types.examples.c3"></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>
</tr>
</table></div>
-<a name="boost_bimap.the_tutorial.controlling_collection_types.examples.repetitions_counter"></a><h6>
-<a name="id778674"></a>
- <a class="link" href="controlling_collection_types.html#boost_bimap.the_tutorial.controlling_collection_types.examples.repetitions_counter">Repetitions
+<h6>
+<a name="boost_bimap.the_tutorial.controlling_collection_types.examples.h1"></a>
+ <a name="boost_bimap.the_tutorial.controlling_collection_types.examples.repetitions_counter"></a><a class="link" href="controlling_collection_types.html#boost_bimap.the_tutorial.controlling_collection_types.examples.repetitions_counter">Repetitions
 counter</a>
 </h6>

@@ -458,12 +457,11 @@
 <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_bimap.the_tutorial.controlling_collection_types.examples.c4" href="controlling_collection_types.html#boost_bimap.the_tutorial.controlling_collection_types.examples.c5"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>

> word_counter;

@@ -477,18 +475,18 @@
 "holds. This is useful in a lot of situations, but there are some "
 "relationships that are bidirectional by nature.";

-// feed the text into the container
-word_counter wc;
+// feed the text into the container
+word_counter wc;
text_tokenizer tok(text,boost::char_separator<char>(" \t\n.,;:!?'\"-"));

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_bimap.the_tutorial.controlling_collection_types.examples.c6" href="controlling_collection_types.html#boost_bimap.the_tutorial.controlling_collection_types.examples.c7"><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
+// list words with counters by order of appearance
+<a class="co" name="boost_bimap.the_tutorial.controlling_collection_types.examples.c8" href="controlling_collection_types.html#boost_bimap.the_tutorial.controlling_collection_types.examples.c9"><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 )
@@ -500,14 +498,14 @@
 
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
-<td width="5%" valign="top" align="left"><a name="boost_bimap6"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap.the_tutorial.controlling_collection_types.examples.c5"></a> </td>
<td valign="top" align="left">
 <code class="computeroutput">counter</code> is an integer
 that is initialized in zero in the constructor
 </td>
</tr>
<tr>
-<td width="5%" valign="top" align="left"><a name="boost_bimap7"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap.the_tutorial.controlling_collection_types.examples.c7"></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
@@ -515,7 +513,7 @@
 </td>
</tr>
<tr>
-<td width="5%" valign="top" align="left"><a name="boost_bimap8"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap.the_tutorial.controlling_collection_types.examples.c9"></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.
@@ -526,7 +524,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/differences_with_standard_maps.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/differences_with_standard_maps.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/differences_with_standard_maps.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_the_tutorial_differences_with_standard_maps">
<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">
+<div class="section boost_bimap_the_tutorial_differences_with_standard_maps_insertion">
<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>
@@ -48,8 +48,8 @@
<pre class="programlisting">bimap<int,std::string> bm;

bm.left.insert(1,"orange");
-bm.left.insert(2,"orange"); // No effect! returns make_pair(iter,false)
-</pre>
+bm.left.insert(2,"orange"); // No effect! returns make_pair(iter,false)
+</pre>

 The insertion will only succeed if it is allowed by all views of the <code class="computeroutput">bimap</code>. In the next snippet we define
 the right collection as a multiset, when we try to insert the same two
@@ -60,14 +60,14 @@
<pre class="programlisting">bimap<int, multiset_of<std::string> > bm;

bm.left.insert(1,"orange");
-bm.left.insert(2,"orange"); // Insertion succeed!
-</pre>
+bm.left.insert(2,"orange"); // Insertion succeed!
+</pre>

 If we use a custom collection of relation type, the insertion has to be
 allowed by it too.
 
</div>
-<div class="section">
+<div class="section boost_bimap_the_tutorial_differences_with_standard_maps_iterator__value_type">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.the_tutorial.differences_with_standard_maps.iterator__value_type"></a><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>
@@ -85,8 +85,8 @@
bm_type bm;
bm.insert( bm_type::relation( 1, "one" ) );
...
-bm.left.find(1)->second = "1"; // Valid
-</pre>
+bm.left.find(1)->second = "1"; // Valid
+</pre>

 In this case, when the iterator is dereferenced the return type is signature-compatible
 with a <code class="computeroutput">std::pair<const int, std::string></code>.
@@ -340,7 +340,7 @@
</tbody>
</table></div>
</div>
-<div class="section">
+<div class="section boost_bimap_the_tutorial_differences_with_standard_maps_operator_____and_at__">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.the_tutorial.differences_with_standard_maps.operator_____and_at__"></a><a 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>
@@ -353,8 +353,8 @@
 
<pre class="programlisting">bimap< unorderd_set_of< std::string>, list_of<int> > bm;

-bm.left["one"] = 1; // Ok
-</pre>
+bm.left["one"] = 1; // Ok
+</pre>

 The standard defines an access function for <code class="computeroutput">map</code>
 and <code class="computeroutput">unordered_map</code>:
@@ -379,50 +379,47 @@
 <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;

try
{
- bm.left.at("one") = 1; // throws std::out_of_range
-}
+ bm.left.at("one") = 1; // throws std::out_of_range
+}
catch( std::out_of_range & e ) {}

assert( bm.empty() );

-bm.left["one"] = 1; // Ok
-
-assert( bm.left.at("one") == 1 ); // Ok
-</pre>
+bm.left["one"] = 1; // Ok
+
+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;

-bm.right[1] = "one"; // compilation error
-
+bm.right[1] = "one"; // compilation error
+
bm.right.insert( bm_type::right_value_type(1,"one") );

-assert( bm.right.at(1) == "one" ); // Ok
-
+assert( bm.right.at(1) == "one" ); // Ok
+
try
{
- std::cout << bm.right.at(2); // throws std::out_of_range
-}
+ std::cout << bm.right.at(2); // throws std::out_of_range
+}
catch( std::out_of_range & e ) {}

-bm.right.at(1) = "1"; // compilation error
-
+bm.right.at(1) = "1"; // compilation error
</pre>

 
</div>
-<div class="section">
+<div class="section boost_bimap_the_tutorial_differences_with_standard_maps_complexity_of_operations">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.the_tutorial.differences_with_standard_maps.complexity_of_operations"></a><a 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>
@@ -435,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/discovering_the_bimap_framework.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/discovering_the_bimap_framework.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/discovering_the_bimap_framework.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_the_tutorial_discovering_the_bimap_framework">
<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">
+<div class="section boost_bimap_the_tutorial_discovering_the_bimap_framework_interpreting_bidirectional_maps">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.the_tutorial.discovering_the_bimap_framework.interpreting_bidirectional_maps"></a><a 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">
+<div class="section boost_bimap_the_tutorial_discovering_the_bimap_framework_standard_mapping_framework">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.the_tutorial.discovering_the_bimap_framework.standard_mapping_framework"></a><a 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="id774525"></a>Table 1.1. std associative containers
+<a name="boost_bimap.the_tutorial.discovering_the_bimap_framework.standard_mapping_framework.t0"></a>Table 1.1. std associative containers
<div class="table-contents"><table class="table" summary="std associative containers">
<colgroup>
<col>
@@ -171,7 +171,7 @@
</div>
 
</div>
-<div class="section">
+<div class="section boost_bimap_the_tutorial_discovering_the_bimap_framework_bimap_mapping_framework">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.the_tutorial.discovering_the_bimap_framework.bimap_mapping_framework"></a><a 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>
@@ -224,10 +224,10 @@

 You have to used references to views, and not directly views object.
 Views cannot be constructed as separate objects from the container they
- belong to, so the following:
+ belong to, so the following:

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

 does not compile, since it is trying to construct the view object <code class="computeroutput">lm</code>. This is a common source of errors
@@ -239,7 +239,6 @@
 <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,
@@ -266,32 +265,32 @@
 typedef bimap< set_of<std::string>, set_of<int> > bimap_type;
 bimap_type bm;

- // Standard map
- {
+ // Standard map
+ {
 typedef std::map< std::string, int > map_type;
 map_type m;

 use_it( m, "one", 1 );
 }

- // Left map view
- {
+ // Left map view
+ {
 typedef bimap_type::left_map map_type;
 map_type & m = bm.left;

 use_it( m, "one", 1 );
 }

- // Reverse standard map
- {
+ // Reverse standard map
+ {
 typedef std::map< int, std::string > reverse_map_type;
 reverse_map_type rm;

 use_it( rm, 1, "one" );
 }

- // Right map view
- {
+ // Right map view
+ {
 typedef bimap_type::right_map reverse_map_type;
 reverse_map_type & rm = bm.right;

@@ -307,7 +306,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/the_collection_of_relations_type.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/the_collection_of_relations_type.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/the_collection_of_relations_type.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_the_tutorial_the_collection_of_relations_type">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.the_tutorial.the_collection_of_relations_type"></a><a 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">
+<div class="section boost_bimap_the_tutorial_the_collection_of_relations_type_a_new_point_of_view">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.the_tutorial.the_collection_of_relations_type.a_new_point_of_view"></a><a 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>
@@ -60,7 +60,7 @@
 times where it is useful to give this collection other constraints or simply
 to order it differently. The user is allowed to choose between:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 left_based
 </li>
@@ -118,7 +118,6 @@
 <a href="../../../../example/mighty_bimap.cpp" target="_top">Go to source code</a>
 

-

<pre class="programlisting">#include <iostream>
#include <string>
@@ -143,9 +142,9 @@

 translator trans;

- // We have to use `push_back` because the collection of relations is
- // a `list_of_relation`
-
+ // We have to use `push_back` because the collection of relations is
+ // a `list_of_relation`
+
 trans.push_back( translator::value_type("hola" ,"hello" ) );
 trans.push_back( translator::value_type("adios" ,"goodbye" ) );
 trans.push_back( translator::value_type("rosa" ,"rose" ) );
@@ -155,8 +154,8 @@
 std::string word;
 std::getline(std::cin,word);

- // Search the queried word on the from index (Spanish)
-
+ // Search the queried word on the from index (Spanish)
+
 translator::map_by<spanish>::const_iterator is
 = trans.by<spanish>().find(word);

@@ -168,8 +167,8 @@
 }
 else
 {
- // Word not found in Spanish, try our luck in English
-
+ // Word not found in Spanish, try our luck in English
+
 translator::map_by<english>::const_iterator ie
 = trans.by<english>().find(word);

@@ -181,8 +180,8 @@
 }
 else
 {
- // Word not found, show the possible translations
-
+ // Word not found, show the possible translations
+
 std::cout << "No such word in the dictionary" << std::endl;
 std::cout << "These are the possible translations" << std::endl;

@@ -205,7 +204,7 @@

 
</div>
-<div class="section">
+<div class="section boost_bimap_the_tutorial_the_collection_of_relations_type_configuration_parameters">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.the_tutorial.the_collection_of_relations_type.configuration_parameters"></a><a 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>
@@ -344,7 +343,7 @@
</tbody>
</table></div>
</div>
-<div class="section">
+<div class="section boost_bimap_the_tutorial_the_collection_of_relations_type_examples">
<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>
@@ -394,7 +393,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/unconstrained_sets.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/unconstrained_sets.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/unconstrained_sets.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_the_tutorial_unconstrained_sets">
<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>
@@ -36,7 +36,7 @@

 Unconstrained sets are useful for the following reasons:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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
@@ -55,7 +55,6 @@
 Given this bimap instance,
 

-

<pre class="programlisting">typedef bimap< std::string, unconstrained_set_of<int> > bm_type;
typedef bm_type::left_map map_type;
@@ -69,7 +68,6 @@
 or this standard map one
 

-

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

@@ -81,7 +79,6 @@
 The following code snippet is valid
 

-

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

@@ -89,7 +86,7 @@

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_bimap.the_tutorial.unconstrained_sets.c0" href="unconstrained_sets.html#boost_bimap.the_tutorial.unconstrained_sets.c1"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>++(i->second);
}

m.erase("one");
@@ -97,7 +94,7 @@

 
<div class="calloutlist"><table border="0" summary="Callout list"><tr>
-<td width="5%" valign="top" align="left"><a name="boost_bimap14"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap.the_tutorial.unconstrained_sets.c1"></a> </td>
<td valign="top" align="left">
 The right collection of the bimap is mutable so its elements can be modified
 using iterators.
@@ -107,12 +104,11 @@
 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_bimap.the_tutorial.unconstrained_sets.c2" href="unconstrained_sets.html#boost_bimap.the_tutorial.unconstrained_sets.c3"><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;
@@ -123,7 +119,7 @@

 
<div class="calloutlist"><table border="0" summary="Callout list"><tr>
-<td width="5%" valign="top" align="left"><a name="boost_bimap15"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap.the_tutorial.unconstrained_sets.c3"></a> </td>
<td valign="top" align="left">
 This range is a model of BidirectionalRange, read the docs of Boost.Range
 for more information.
@@ -135,7 +131,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/useful_functions.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/useful_functions.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/useful_functions.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<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">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<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">
+<div class="section boost_bimap_the_tutorial_useful_functions">
<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">
+<div class="section boost_bimap_the_tutorial_useful_functions_projection_of_iterators">
<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,7 +55,6 @@
 <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;

@@ -64,8 +63,8 @@
bm.insert( bm_type::value_type("Peter",24) );
bm.insert( bm_type::value_type("Mary" ,12) );

-// Find the name of the next younger person after Peter
-
+// Find the name of the next younger person after Peter
+
bm_type::left_const_iterator name_iter = bm.left.find("Peter");

bm_type::right_const_iterator years_iter = bm.project_right(name_iter);
@@ -77,7 +76,7 @@

 
</div>
-<div class="section">
+<div class="section boost_bimap_the_tutorial_useful_functions_replace_and_modify">
<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>
@@ -96,15 +95,14 @@
 code</a>
 

-

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

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

-// Replace (1,"one") with (1,"1") using the right map view
-{
+// Replace (1,"one") with (1,"1") using the right map view
+{
 bm_type::right_iterator it = bm.right.find("one");

 bool successful_replace = bm.right.replace_key( it, "1" );
@@ -114,22 +112,22 @@

bm.insert( bm_type::value_type(2,"two") );

-// Fail to replace (1,"1") with (1,"two") using the left map view
-{
+// Fail to replace (1,"1") with (1,"two") using the left map view
+{
 assert( bm.size() == 2 );

 bm_type::left_iterator it = bm.left.find(1);

 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_bimap.the_tutorial.useful_functions.replace_and_modify.c0" href="useful_functions.html#boost_bimap.the_tutorial.useful_functions.replace_and_modify.c1"><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 width="5%" valign="top" align="left"><a name="boost_bimap.the_tutorial.useful_functions.replace_and_modify.c1"></a> </td>
<td valign="top" align="left">
 <code class="computeroutput">it</code> is still valid here,
 and the bimap was left unchanged
@@ -139,7 +137,7 @@
 <code class="computeroutput">replace</code> functions performs
 this substitution in such a manner that:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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.
@@ -197,14 +195,13 @@
 code</a>
 

-

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

-// Modify (1,"one") to (1,"1") using the right map view
-{
+// Modify (1,"one") to (1,"1") using the right map view
+{
 bm_type::right_iterator it = bm.right.find("one");

 bool successful_modify = bm.right.modify_key( it , _key = "1" );
@@ -214,29 +211,29 @@

bm.insert( bm_type::value_type(2,"two") );

-// Fail to modify (1,"1") to (1,"two") using the left map view
-{
+// Fail to modify (1,"1") to (1,"two") using the left map view
+{
 assert( bm.size() == 2 );

 bm_type::left_iterator it = bm.left.find(1);

 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_bimap.the_tutorial.useful_functions.replace_and_modify.c2" href="useful_functions.html#boost_bimap.the_tutorial.useful_functions.replace_and_modify.c3"><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 width="5%" valign="top" align="left"><a name="boost_bimap.the_tutorial.useful_functions.replace_and_modify.c3"></a> </td>
<td valign="top" align="left">
 <code class="computeroutput">it</code> is not longer valid
 and <code class="computeroutput">(1,"1")</code> is removed from the bimap
 </td>
</tr></table></div>
</div>
-<div class="section">
+<div class="section boost_bimap_the_tutorial_useful_functions_retrieval_of_ranges">
<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>
@@ -251,18 +248,17 @@
 <code class="computeroutput">[20,50]</code>
 

-

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

-// ...
-
+// ...
+
bm_type::left_iterator iter_first = bm.left.lower_bound(20);
bm_type::left_iterator iter_second = bm.left.upper_bound(50);

-// range [iter_first,iter_second) contains the elements in [20,50]
-</pre>
+// range [iter_first,iter_second) contains the elements in [20,50]
+</pre>

 

@@ -271,13 +267,12 @@
 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);

-// range [iter_first,iter_second) contains the elements in (20,50)
-</pre>
+// range [iter_first,iter_second) contains the elements in (20,50)
+</pre>

 

@@ -294,26 +289,25 @@
 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_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>
+// ...
+
+<a class="co" name="boost_bimap.the_tutorial.useful_functions.retrieval_of_ranges.c0" href="useful_functions.html#boost_bimap.the_tutorial.useful_functions.retrieval_of_ranges.c1"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>bm_type::left_range_type r;
+
+<a class="co" name="boost_bimap.the_tutorial.useful_functions.retrieval_of_ranges.c2" href="useful_functions.html#boost_bimap.the_tutorial.useful_functions.retrieval_of_ranges.c3"><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 width="5%" valign="top" align="left"><a name="boost_bimap.the_tutorial.useful_functions.retrieval_of_ranges.c1"></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>
@@ -321,7 +315,7 @@
 </td>
</tr>
<tr>
-<td width="5%" valign="top" align="left"><a name="boost_bimap12"></a> </td>
+<td width="5%" valign="top" align="left"><a name="boost_bimap.the_tutorial.useful_functions.retrieval_of_ranges.c3"></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>
@@ -338,18 +332,17 @@
 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)
-</pre>
+<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_bimap.the_tutorial.useful_functions.retrieval_of_ranges.c4" href="useful_functions.html#boost_bimap.the_tutorial.useful_functions.retrieval_of_ranges.c5"><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 width="5%" valign="top" align="left"><a name="boost_bimap.the_tutorial.useful_functions.retrieval_of_ranges.c5"></a> </td>
<td valign="top" align="left">
 This is equivalent to std::make_pair(s.begin(),s.end())
 </td>
@@ -361,7 +354,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-2012 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)

Modified: branches/release/libs/bimap/doc/html/index.html
==============================================================================
--- branches/release/libs/bimap/doc/html/index.html (original)
+++ branches/release/libs/bimap/doc/html/index.html 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -3,7 +3,7 @@
<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.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<link rel="home" href="index.html" title="Chapter 1. Boost.Bimap">
<link rel="next" href="boost_bimap/introduction.html" title="Introduction">
</head>
@@ -25,9 +25,9 @@
<div><div class="author"><h3 class="author">
Matias Capeletto
</h3></div></div>
-<div>Copyright © 2006 -2007 Matias Capeletto</div>
+<div>Copyright © 2006-2012 Matias Capeletto</div>
<div><div class="legalnotice">
-<a name="id768625"></a>
+<a name="bimap.legal"></a>
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -115,13 +115,13 @@
<dt>Acknowledgements</dt>
</dl>
</div>
-<div class="section">
+<div class="section bimap_preface">
<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="id768655"></a>
- <a class="link" href="index.html#bimap.preface.description">Description</a>
+<h4>
+<a name="bimap.preface.h0"></a>
+ <a name="bimap.preface.description"></a><a class="link" href="index.html#bimap.preface.description">Description</a>
 </h4>

 <img src="images/bimap/boost.bimap.logo.png" alt="boost.bimap.logo">
@@ -136,10 +136,10 @@
 of the STL in Boost.Bimap. The library is designed to match the common STL
 containers.
 
-<a name="bimap.preface.influences_and_related_work"></a><h4>
-<a name="id769071"></a>
- <a class="link" href="index.html#bimap.preface.influences_and_related_work">Influences and Related
- Work</a>
+<h4>
+<a name="bimap.preface.h1"></a>
+ <a name="bimap.preface.influences_and_related_work"></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.
@@ -149,7 +149,7 @@
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left">Last revised: February 27, 2011 at 11:45:22 GMT</td>
+<td align="left">Last revised: December 10, 2012 at 13:07:47 GMT</td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>

Modified: branches/release/libs/bimap/doc/release_notes.qbk
==============================================================================
--- branches/release/libs/bimap/doc/release_notes.qbk (original)
+++ branches/release/libs/bimap/doc/release_notes.qbk 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -14,6 +14,29 @@

[section Release notes]

-Not yet released.
+[heading Boost 1.53 release]
+
+* Refactor map_view_iterator to improve error messages.
+* Fixed replace_(left/right/key/data) bug when using relations with info.
+* Fixed vector_of and list_of views `assign(size_type,value_type)` bug.
+* Fixed vector_of views `operator[](size_type)` and `at(size_type)` functions return value.
+
+[heading Boost 1.52 release]
+
+* Fixed unused parameter name warnings in Boost.Bimap ([@https://svn.boost.org/trac/boost/ticket/7425 #7425]).
+
+[heading Boost 1.50 release]
+
+* Added key_type and mapped_type (leaving data_type for backward compatibility) typedefs to map views ([@https://svn.boost.org/trac/boost/ticket/6031 #6031]).
+* Removed spurious dependency on Boost.Serialization ([@https://svn.boost.org/trac/boost/ticket/3868 #3868]).
+* Solved unused constructor parameter warning ([@https://svn.boost.org/trac/boost/ticket/5749 #5749]).
+
+[heading Boost 1.45 release]
+* Fixed custom allocators ([@https://svn.boost.org/trac/boost/ticket/3665 #3665]).
+* Fixed count() constness ([@https://svn.boost.org/trac/boost/ticket/2484 #2484]).
+* Other maintenance fixes.
+
+[heading Boost 1.35 release]
+* Added to Boost Libraries.

[endsect]
\ No newline at end of file

Modified: branches/release/libs/bimap/example/step_by_step.cpp
==============================================================================
--- branches/release/libs/bimap/example/step_by_step.cpp (original)
+++ branches/release/libs/bimap/example/step_by_step.cpp 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -98,5 +98,5 @@

return 0;
}
-//]
+

Modified: branches/release/libs/bimap/example/tutorial_modify_and_replace.cpp
==============================================================================
--- branches/release/libs/bimap/example/tutorial_modify_and_replace.cpp (original)
+++ branches/release/libs/bimap/example/tutorial_modify_and_replace.cpp 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -114,5 +114,5 @@
test_modify();
return 0;
}
-//]
+

Modified: branches/release/libs/bimap/test/test_bimap.hpp
==============================================================================
--- branches/release/libs/bimap/test/test_bimap.hpp (original)
+++ branches/release/libs/bimap/test/test_bimap.hpp 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -18,10 +18,12 @@
// std
#include <cassert>
#include <algorithm>
+#include <iterator>

#include <boost/lambda/lambda.hpp>
#include <boost/static_assert.hpp>
#include <boost/type_traits/is_same.hpp>
+#include <boost/utility.hpp>

template< class Container, class Data >
void test_container(Container & c, const Data & d)
@@ -59,7 +61,6 @@
 BOOST_CHECK( c.size() == 2 );

 BOOST_CHECK( c.begin() != c.end() );
-
}

template< class Container, class Data >
@@ -99,6 +100,58 @@

 BOOST_CHECK( c.begin() != c.end() );

+ c.clear();
+ BOOST_CHECK( c.empty() );
+
+ // assign
+
+ c.assign(d.begin(),d.end());
+ BOOST_CHECK( c.size() == d.size() );
+ BOOST_CHECK( std::equal( c.begin(), c.end(), d.begin() ) );
+
+ c.assign(d.size(),*d.begin());
+ BOOST_CHECK( c.size() == d.size() );
+ BOOST_CHECK( *c.begin() == *d.begin() );
+
+ // Check insert(IterPos,InputIter,InputIter)
+
+ c.clear();
+ c.insert( c.begin(), d.begin(), d.end() );
+ c.insert( boost::next(c.begin(),2), d.begin(), d.end() );
+
+ BOOST_CHECK( std::equal( boost::next(c.begin(),2)
+ , boost::next(c.begin(),2+d.size()) , d.begin() ) );
+
+ // Check resize
+
+ c.clear() ;
+ c.resize(4,*d.begin());
+ BOOST_CHECK( c.size() == 4 );
+ BOOST_CHECK( *c.begin() == *d.begin() ) ;
+
+ BOOST_CHECK( c == c );
+ BOOST_CHECK( ! ( c != c ) );
+ BOOST_CHECK( ! ( c < c ) );
+ BOOST_CHECK( ( c <= c ) );
+ BOOST_CHECK( ! ( c > c ) );
+ BOOST_CHECK( ( c >= c ) );
+}
+
+template< class Container, class Data >
+void test_vector_container(Container & c, const Data & d)
+{
+ assert( d.size() > 2 );
+
+ c.clear() ;
+ c.reserve(2) ;
+ BOOST_CHECK( c.capacity() >= 2 ) ;
+ c.assign(d.begin(),d.end());
+ BOOST_CHECK( c.capacity() >= c.size() ) ;
+
+ BOOST_CHECK( c[0] == *d.begin() ) ;
+ BOOST_CHECK( c.at(1) == *boost::next(d.begin()) );
+
+ test_sequence_container(c,d) ;
}

template< class Container, class Data >
@@ -234,6 +287,13 @@

 test_simple_ordered_associative_container_equality(cr, d);

+ BOOST_CHECK( c == c );
+ BOOST_CHECK( ! ( c != c ) );
+ BOOST_CHECK( ! ( c < c ) );
+ BOOST_CHECK( ( c <= c ) );
+ BOOST_CHECK( ! ( c > c ) );
+ BOOST_CHECK( ( c >= c ) );
+
 /*
 BOOST_CHECK( c.range( *c.begin() <= ::boost::lambda::_1,
 ::boost::lambda::_1 <= *(++c.begin()) ).
@@ -515,5 +575,35 @@
 test_unique_container(b.right, rd);
}

+template< class Bimap, class Data>
+void test_bimap_init_copy_swap(const Data&d)
+{
+ Bimap b1(d.begin(),d.end());
+ Bimap b2( b1 );
+ BOOST_CHECK( b1 == b2 );
+
+ b2.clear();
+ b2 = b1;
+ BOOST_CHECK( b2 == b1 );
+
+ b2.clear();
+ b2.left = b1.left;
+ BOOST_CHECK( b2 == b1 );
+
+ b2.clear();
+ b2.right = b1.right;
+ BOOST_CHECK( b2 == b1 );
+
+ b1.clear();
+ b2.swap(b1);
+ BOOST_CHECK( b2.empty() && !b1.empty() );
+
+ b1.left.swap( b2.left );
+ BOOST_CHECK( b1.empty() && !b2.empty() );
+
+ b1.right.swap( b2.right );
+ BOOST_CHECK( b2.empty() && !b1.empty() );
+}
+
#endif // LIBS_BIMAP_TEST_BIMAP_TEST_HPP

Modified: branches/release/libs/bimap/test/test_bimap_extra.cpp
==============================================================================
--- branches/release/libs/bimap/test/test_bimap_extra.cpp (original)
+++ branches/release/libs/bimap/test/test_bimap_extra.cpp 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -34,13 +34,14 @@
#include <boost/bimap/support/map_type_by.hpp>
#include <boost/bimap/support/value_type_by.hpp>
#include <boost/bimap/support/iterator_type_by.hpp>
+#include <boost/bimap/relation/support/pair_type_by.hpp>

using namespace boost::bimaps;
using namespace boost::bimaps::support;
+using namespace boost::bimaps::relation::support ;

typedef bimap<int, unconstrained_set_of<double> > bm_type;

-
namespace support_metafunctions_test {

typedef boost::is_same
@@ -67,6 +68,14 @@
>::type test_metafunction_3;
BOOST_STATIC_ASSERT(test_metafunction_3::value);

+ typedef boost::is_same
+ <
+ pair_type_by< member_at::left, bm_type::relation>::type,
+ value_type_by< member_at::left , bm_type >::type
+
+ >::type test_metafunction_4;
+ BOOST_STATIC_ASSERT(test_metafunction_4::value);
+
} // namespace support_metafunctions_test

void test_bimap_extra()

Modified: branches/release/libs/bimap/test/test_bimap_modify.cpp
==============================================================================
--- branches/release/libs/bimap/test/test_bimap_modify.cpp (original)
+++ branches/release/libs/bimap/test/test_bimap_modify.cpp 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -174,10 +174,76 @@

}

+void test_bimap_replace_with_info()
+{
+ using namespace boost::bimaps;
+ typedef bimap<int,long,with_info<int> > bm;
+
+ bm b;
+ b.insert( bm::value_type(2,200,-2) );
+
+ BOOST_CHECK( b.left.at(2) == 200 );
+ BOOST_CHECK( b.left.info_at(2) == -2 );
+
+ // Use set view
+ {
+ bm::iterator i = b.begin();
+
+ bool result = b.replace( i, bm::value_type(1,100,-1) );
+
+ BOOST_CHECK( result );
+ BOOST_CHECK( b.size() == 1 );
+ BOOST_CHECK( i->left == 1 && i->right == 100 );
+ BOOST_CHECK( i->info == -1 );
+
+ result = b.replace_left( i, 2 );
+
+ BOOST_CHECK( result );
+ BOOST_CHECK( b.size() == 1 );
+ BOOST_CHECK( i->left == 2 && i->right == 100 );
+ BOOST_CHECK( i->info == -1 );
+
+ result = b.replace_right( i, 200 );
+
+ BOOST_CHECK( result );
+ BOOST_CHECK( b.size() == 1 );
+ BOOST_CHECK( i->left == 2 && i->right == 200 );
+ BOOST_CHECK( i->info == -1 );
+ }
+
+ // Use map view
+ {
+ bm::left_iterator i = b.left.begin();
+
+ bool result = b.left.replace( i, bm::left_value_type(1,100,-1) );
+
+ BOOST_CHECK( result );
+ BOOST_CHECK( b.left.size() == 1 );
+ BOOST_CHECK( i->first == 1 && i->second == 100 );
+ BOOST_CHECK( i->info == -1 );
+
+ result = b.left.replace_key( i, 2 );
+
+ BOOST_CHECK( result );
+ BOOST_CHECK( b.left.size() == 1 );
+ BOOST_CHECK( i->first == 2 && i->second == 100 );
+ BOOST_CHECK( i->info == -1 );
+
+ result = b.left.replace_data( i, 200 );
+
+ BOOST_CHECK( result );
+ BOOST_CHECK( b.left.size() == 1 );
+ BOOST_CHECK( i->first == 2 && i->second == 200 );
+ BOOST_CHECK( i->info == -1 );
+ }
+}
+
int test_main( int, char* [] )
{
test_bimap_modify();

+ test_bimap_replace_with_info();
+
return 0;
}

Modified: branches/release/libs/bimap/test/test_bimap_sequenced.cpp
==============================================================================
--- branches/release/libs/bimap/test/test_bimap_sequenced.cpp (original)
+++ branches/release/libs/bimap/test/test_bimap_sequenced.cpp 2012-12-14 09:21:53 EST (Fri, 14 Dec 2012)
@@ -43,6 +43,55 @@
struct left_tag {};
struct right_tag {};

+
+template< class Container, class Data >
+void test_list_operations(Container & b, Container& c, const Data & d)
+{
+ c.clear() ;
+ c.assign(d.begin(),d.end());
+
+ BOOST_CHECK( std::equal( c.begin(), c.end(), d.begin() ) );
+ c.reverse();
+ BOOST_CHECK( std::equal( c.begin(), c.end(), d.rbegin() ) );
+
+ c.sort();
+ BOOST_CHECK( std::equal( c.begin(), c.end(), d.begin() ) );
+
+ c.push_front( *d.begin() );
+ BOOST_CHECK( c.size() == d.size()+1 );
+ c.unique();
+ BOOST_CHECK( c.size() == d.size() );
+
+ c.relocate( c.begin(), ++c.begin() );
+ c.relocate( c.end(), c.begin(), ++c.begin() );
+
+ b.clear();
+ c.clear();
+
+ c.assign(d.begin(),d.end());
+ b.splice(b.begin(),c);
+
+ BOOST_CHECK( c.size() == 0 );
+ BOOST_CHECK( b.size() == d.size() );
+
+ c.splice(c.begin(),b,++b.begin());
+
+ BOOST_CHECK( c.size() == 1 );
+
+ c.splice(c.begin(),b,b.begin(),b.end());
+
+ BOOST_CHECK( b.size() == 0 );
+
+ b.assign(d.begin(),d.end());
+ c.assign(d.begin(),d.end());
+ b.sort();
+ c.sort();
+ b.merge(c);
+ BOOST_CHECK( b.size() == 2*d.size() );
+
+ b.unique();
+}
+
void test_bimap()
{
 using namespace boost::bimaps;
@@ -66,7 +115,7 @@
 {
 typedef bimap<
 list_of< std::string >, vector_of< long >
-
+
> bm_type;

 std::set< bm_type::value_type > data;
@@ -77,120 +126,55 @@

 bm_type b;

+ test_bimap_init_copy_swap<bm_type>(data) ;
 test_sequence_container(b,data);
 test_sequence_container(b.left , left_data);
- test_sequence_container(b.right,right_data);
+ test_vector_container(b.right,right_data);

 test_mapped_container(b.left );
 test_mapped_container(b.right);

 bm_type c;
+ test_list_operations(b,c,data) ;
+ test_list_operations(b.left,c.left,left_data) ;
+ test_list_operations(b.right,c.right,right_data) ;

- // Test assign
-
- b.clear();
- BOOST_CHECK( b.empty() );
-
- b.left.assign(left_data.begin(),left_data.end());
- BOOST_CHECK( b.size() == left_data.size() );
-
- b.right.assign(right_data.begin(),right_data.end());
- BOOST_CHECK( b.size() == right_data.size() );
-
+ c.assign(data.begin(),data.end());
 b.assign(data.begin(),data.end());
- BOOST_CHECK( b.size() == data.size() );
-
- // Test splice and merge
-
- b.clear();
-
- c.left.insert(c.left.begin(),left_data.begin(),left_data.end());
- b.left.splice(b.left.begin(),c.left);
-
- BOOST_CHECK( c.size() == 0 );
- BOOST_CHECK( b.size() == 4 );
-
- c.left.splice(c.left.begin(),b.left,++b.left.begin());
-
- BOOST_CHECK( c.size() == 1 );
-
- c.splice(c.begin(),b,b.begin(),b.end());
-
- BOOST_CHECK( b.size() == 0 );
-
- b.left.merge(c.left);
- c.left.merge(b.left,std::less<std::string>());
-
- b.left.sort();
+ c.remove_if(_key<=bm_type::value_type("1",1));
+ c.sort(std::less<bm_type::value_type>());
+ b.sort(std::less<bm_type::value_type>());
+ c.merge(b,std::less<bm_type::value_type>());
+ c.unique(std::equal_to<bm_type::value_type>());
+
+ c.assign(data.begin(),data.end());
+ b.assign(data.begin(),data.end());
+ c.left.remove_if(_key<="1");
+ c.left.sort(std::less<std::string>());
 b.left.sort(std::less<std::string>());
-
- b.left.unique();
- b.left.unique(std::equal_to<std::string>());
-
- b.assign( data.begin(), data.end() );
-
- BOOST_CHECK( std::equal( b.begin(), b.end(), data.begin() ) );
- b.reverse();
- BOOST_CHECK( std::equal( b.rbegin(), b.rend(), data.begin() ) );
-
- b.sort();
-
- BOOST_CHECK( std::equal( b.begin(), b.end(), data.begin() ) );
-
- b.push_back( bm_type::value_type("4",4) );
- BOOST_CHECK( b.size() == 5 );
- b.unique();
- BOOST_CHECK( b.size() == 4 );
- b.remove_if( _key < bm_type::value_type("2",2) );
- BOOST_CHECK( b.size() == 3 );
-
- b.merge(c);
-
- b.left.remove_if( _key < "3" );
-
- // Test splice and merge
-
- b.clear(); c.clear();
-
- c.left.insert(c.left.begin(),left_data.begin(),left_data.end());
- b.right.splice(b.right.begin(),c.right);
-
- BOOST_CHECK( c.size() == 0 );
- BOOST_CHECK( b.size() == 4 );
-
- c.right.splice(c.right.begin(),b.right,++b.right.begin());
-
- b.right.merge(c.right);
- c.right.merge(b.right,std::less<long>());
-
- b.right.sort();
+ c.left.merge(b.left,std::less<std::string>());
+ c.left.unique(std::equal_to<std::string>());
+
+ c.assign(data.begin(),data.end());
+ b.assign(data.begin(),data.end());
+ c.right.remove_if(_key<=1);
+ c.right.sort(std::less<long>());
 b.right.sort(std::less<long>());
+ c.right.merge(b.right,std::less<long>());
+ c.right.unique(std::equal_to<long>());

- b.right.unique();
- b.right.unique(std::equal_to<long>());
-
- b.right.remove_if( _key < 3 );
-
- b.clear();
- b.left.insert(b.left.begin(),left_data.begin(),left_data.end());
-
- b.left.relocate(b.left.begin(), ++b.left.begin() );
- b.left.relocate(b.left.end(), b.left.begin(), ++b.left.begin() );
-
- b.right.relocate(b.right.begin(), ++b.right.begin() );
- b.right.relocate(b.right.end(), b.right.begin(), ++b.right.begin() );
-
- b.relocate(b.begin(), ++b.begin() );
- b.relocate(b.end(), b.begin(), ++b.begin() );
+ c.assign(data.begin(),data.end());
+ c.right[0].first = -1;
+ c.right.at(0).second = "[1]";
 }
 //--------------------------------------------------------------------

-
+
 //--------------------------------------------------------------------
 {
 typedef bimap
 <
- list_of<std::string>, list_of<long>,
+ vector_of<std::string>, list_of<long>,
 vector_of_relation

> bm_type;
@@ -200,92 +184,87 @@
 data.insert( bm_type::value_type("2",2) );
 data.insert( bm_type::value_type("3",3) );
 data.insert( bm_type::value_type("4",4) );
-
+
 bm_type b;
- b.push_back( bm_type::value_type("1",1) );
- b.push_back( bm_type::value_type("2",2) );
- b.push_back( bm_type::value_type("3",3) );
- b.push_back( bm_type::value_type("4",4) );
-
- BOOST_CHECK( std::equal( b.begin(), b.end(), data.begin() ) );
- b.reverse();
- BOOST_CHECK( std::equal( b.rbegin(), b.rend(), data.begin() ) );
-
- b.sort();
-
- BOOST_CHECK( std::equal( b.begin(), b.end(), data.begin() ) );
-
- b.push_back( bm_type::value_type("4",4) );
- BOOST_CHECK( b.size() == 5 );
- b.unique();
- BOOST_CHECK( b.size() == 4 );
- b.remove_if( _key < bm_type::value_type("2",2) );
- BOOST_CHECK( b.size() == 3 );
-
- b.relocate( b.begin(), ++b.begin() );
- b.relocate( b.end(), b.begin(), ++b.begin() );
-
- b.clear();
- BOOST_CHECK( b.empty() );
-
- b.left.assign(left_data.begin(),left_data.end());
- BOOST_CHECK( b.size() == left_data.size() );
-
- b.right.assign(right_data.begin(),right_data.end());
- BOOST_CHECK( b.size() == right_data.size() );
-
+
+ test_bimap_init_copy_swap<bm_type>(data) ;
+ test_vector_container(b,data) ;
+
+ bm_type c;
+ test_list_operations(b,c,data) ;
+ test_list_operations(b.left,c.left,left_data) ;
+ test_list_operations(b.right,c.right,right_data) ;
+
+ c.assign(data.begin(),data.end());
+ b.assign(data.begin(),data.end());
+ c.remove_if(_key<=bm_type::value_type("1",1));
+ c.sort(std::less<bm_type::value_type>());
+ b.sort(std::less<bm_type::value_type>());
+ c.merge(b,std::less<bm_type::value_type>());
+ c.unique(std::equal_to<bm_type::value_type>());
+
+ c.assign(data.begin(),data.end());
+ b.assign(data.begin(),data.end());
+ c.left.remove_if(_key<="1");
+ c.left.sort(std::less<std::string>());
+ b.left.sort(std::less<std::string>());
+ c.left.merge(b.left,std::less<std::string>());
+ c.left.unique(std::equal_to<std::string>());
+
+ c.assign(data.begin(),data.end());
 b.assign(data.begin(),data.end());
- BOOST_CHECK( b.size() == data.size() );
+ c.right.remove_if(_key<=1);
+ c.right.sort(std::less<long>());
+ b.right.sort(std::less<long>());
+ c.right.merge(b.right,std::less<long>());
+ c.right.unique(std::equal_to<long>());
+
+ c.assign(data.begin(),data.end());
+ c[0].left = "(1)";
+ c.at(0).right = -1;
+ c.left[0].first = "[1]";
+ c.left.at(0).second = -1;
 }
 //--------------------------------------------------------------------

-
+
 //--------------------------------------------------------------------
 {
 typedef bimap
 <
- vector_of< short >, list_of< short >,
- vector_of_relation
-
- > bimap_type;
-
- bimap_type b1;
-
- b1.push_back( bimap_type::value_type(1,2) );
-
- bimap_type b2( b1 );
-
- BOOST_CHECK( b1 == b2 );
- BOOST_CHECK( ! ( b1 != b2 ) );
- BOOST_CHECK( b1 <= b2 );
- BOOST_CHECK( b1 >= b2 );
- BOOST_CHECK( ! ( b1 < b2 ) );
- BOOST_CHECK( ! ( b1 > b2 ) );
-
- b1.push_back( bimap_type::value_type(2,3) );
-
- b2 = b1;
- BOOST_CHECK( b2 == b1 );
-
- b1.push_back( bimap_type::value_type(3,4) );
-
- b2.left = b1.left;
- BOOST_CHECK( b2 == b1 );
-
- b1.push_back( bimap_type::value_type(4,5) );
+ vector_of<std::string>, list_of<long>,
+ list_of_relation

- b2.right = b1.right;
- BOOST_CHECK( b2 == b1 );
-
- b1.clear();
- b2.swap(b1);
- BOOST_CHECK( b2.empty() && !b1.empty() );
+ > bm_type;

- b1.left.swap( b2.left );
- BOOST_CHECK( b1.empty() && !b2.empty() );
+ std::set< bm_type::value_type > data;
+ data.insert( bm_type::value_type("1",1) );
+ data.insert( bm_type::value_type("2",2) );
+ data.insert( bm_type::value_type("3",3) );
+ data.insert( bm_type::value_type("4",4) );
+
+ bm_type b;
+
+ test_bimap_init_copy_swap<bm_type>(data) ;
+ test_sequence_container(b,data) ;
+
+ bm_type c;
+ test_list_operations(b,c,data) ;
+ test_list_operations(b.left,c.left,left_data) ;
+ test_list_operations(b.right,c.right,right_data) ;

- b1.right.swap( b2.right );
- BOOST_CHECK( b2.empty() && !b1.empty() );
+
+ c.assign(data.begin(),data.end());
+ b.assign(data.begin(),data.end());
+ c.remove_if(_key<=bm_type::value_type("1",1));
+ c.sort(std::less<bm_type::value_type>());
+ b.sort(std::less<bm_type::value_type>());
+ c.merge(b,std::less<bm_type::value_type>());
+ c.unique(std::equal_to<bm_type::value_type>());
+
+ c.assign(data.begin(),data.end());
+ c.left[0].first = "[1]";
+ c.left.at(0).second = -1;
 }
 //--------------------------------------------------------------------

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