[Boost-commit] svn:boost r85297 - in trunk: boost/container libs/container/doc

Subject: [Boost-commit] svn:boost r85297 - in trunk: boost/container libs/container/doc
From: igaztanaga_at_[hidden]
Date: 2013-08-10 18:58:27

Author: igaztanaga
Date: 2013-08-10 18:58:27 EDT (Sat, 10 Aug 2013)
New Revision: 85297
URL: http://svn.boost.org/trac/boost/changeset/85297

Log:
Fixes #8269

Text files modified: 
   trunk/boost/container/flat_map.hpp     |    13 ++++++++++++-                           
   trunk/boost/container/flat_set.hpp     |    17 +++++++++--------                       
   trunk/libs/container/doc/container.qbk |     3 ++-                                     
   3 files changed, 23 insertions(+), 10 deletions(-)

Modified: trunk/boost/container/flat_map.hpp
==============================================================================
--- trunk/boost/container/flat_map.hpp	Sat Aug 10 18:41:48 2013	(r85296)
+++ trunk/boost/container/flat_map.hpp	2013-08-10 18:58:27 EDT (Sat, 10 Aug 2013)	(r85297)
@@ -84,8 +84,10 @@
 //! This means that inserting a new element into a flat_map invalidates
 //! previous iterators and references
 //!
-//! Erasing an element of a flat_map invalidates iterators and references
+//! Erasing an element invalidates iterators and references
 //! pointing to elements that come after (their keys are bigger) the erased element.
+//!
+//! This container provides random-access iterators.
 #ifdef BOOST_CONTAINER_DOXYGEN_INVOKED
 template <class Key, class T, class Compare = std::less<Key>, class Allocator = std::allocator< std::pair< Key, T> > >
 #else
@@ -947,6 +949,15 @@
 //!
 //! Allocator is the allocator to allocate the value_types
 //! (e.g. <i>allocator< std::pair<Key, T> ></i>).
+//!
+//! flat_multimap is similar to std::multimap but it's implemented like an ordered vector.
+//! This means that inserting a new element into a flat_map invalidates
+//! previous iterators and references
+//!
+//! Erasing an element invalidates iterators and references
+//! pointing to elements that come after (their keys are bigger) the erased element.
+//!
+//! This container provides random-access iterators.
 #ifdef BOOST_CONTAINER_DOXYGEN_INVOKED
 template <class Key, class T, class Compare = std::less<Key>, class Allocator = std::allocator< std::pair< Key, T> > >
 #else

Modified: trunk/boost/container/flat_set.hpp
==============================================================================
--- trunk/boost/container/flat_set.hpp	Sat Aug 10 18:41:48 2013	(r85296)
+++ trunk/boost/container/flat_set.hpp	2013-08-10 18:58:27 EDT (Sat, 10 Aug 2013)	(r85297)
@@ -51,9 +51,7 @@
 /// @endcond
 
 //! flat_set is a Sorted Associative Container that stores objects of type Key.
-//! flat_set is a Simple Associative Container, meaning that its value type,
-//! as well as its key type, is Key. It is also a Unique Associative Container,
-//! meaning that no two elements are the same.
+//! It is also a Unique Associative Container, meaning that no two elements are the same.
 //!
 //! flat_set is similar to std::set but it's implemented like an ordered vector.
 //! This means that inserting a new element into a flat_set invalidates
@@ -61,6 +59,8 @@
 //!
 //! Erasing an element of a flat_set invalidates iterators and references
 //! pointing to elements that come after (their keys are bigger) the erased element.
+//!
+//! This container provides random-access iterators.
 #ifdef BOOST_CONTAINER_DOXYGEN_INVOKED
 template <class Key, class Compare = std::less<Key>, class Allocator = std::allocator<Key> >
 #else
@@ -763,16 +763,17 @@
 /// @endcond
 
 //! flat_multiset is a Sorted Associative Container that stores objects of type Key.
-//! flat_multiset is a Simple Associative Container, meaning that its value type,
-//! as well as its key type, is Key.
-//! flat_Multiset can store multiple copies of the same key value.
+//!
+//! flat_multiset can store multiple copies of the same key value.
 //!
 //! flat_multiset is similar to std::multiset but it's implemented like an ordered vector.
 //! This means that inserting a new element into a flat_multiset invalidates
 //! previous iterators and references
 //!
-//! Erasing an element of a flat_multiset invalidates iterators and references
-//! pointing to elements that come after (their keys are equal or bigger) the erased element.
+//! Erasing an element invalidates iterators and references
+//! pointing to elements that come after (their keys are bigger) the erased element.
+//!
+//! This container provides random-access iterators.
 #ifdef BOOST_CONTAINER_DOXYGEN_INVOKED
 template <class Key, class Compare = std::less<Key>, class Allocator = std::allocator<Key> >
 #else

Modified: trunk/libs/container/doc/container.qbk
==============================================================================
--- trunk/libs/container/doc/container.qbk	Sat Aug 10 18:41:48 2013	(r85296)
+++ trunk/libs/container/doc/container.qbk	2013-08-10 18:58:27 EDT (Sat, 10 Aug 2013)	(r85297)
@@ -375,7 +375,8 @@
 attributes:
 
 * Faster lookup than standard associative containers
-* Much faster iteration than standard associative containers
+* Much faster iteration than standard associative containers.
+   Random-access iterators instead of bidirectional iterators.
 * Less memory consumption for small objects (and for big objects if `shrink_to_fit` is used)
 * Improved cache performance (data is stored in contiguous memory)
 * Non-stable iterators (iterators are invalidated when inserting and erasing elements)