feedc0de/boost_container
1
0
Fork 0
forked from boostorg/container
Code Pull Requests Activity

Fixes #132: flat_map::lower_bound and upper_bound have wrong/misleading docs

Browse Source
This commit is contained in:
Ion Gaztañaga
2019-10-19 22:55:46 +02:00
parent d9341ec394
commit 1cf19898c0
5 changed files with 77 additions and 69 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
doc/container.qbk
View File

@@ -1319,6 +1319,14 @@ use [*Boost.Container]? There are several reasons for that:
[section:release_notes Release Notes] [section:release_notes Release Notes]
[section:release_notes_boost_1_72_00 Boost 1.72 Release]
* Fixed bugs:
* [@https://github.com/boostorg/container/issues/132 GitHub #132: ['"flat_map::lower_bound and upper_bound have wrong/misleading docs"]].
[endsect]
[section:release_notes_boost_1_71_00 Boost 1.71 Release] [section:release_notes_boost_1_71_00 Boost 1.71 Release]
* Fixed bugs: * Fixed bugs:

44
include/boost/container/flat_map.hpp
View File

@@ -1199,7 +1199,7 @@ class flat_map
//! //!
//! <b>Throws</b>: Nothing unless the comparison object throws. //! <b>Throws</b>: Nothing unless the comparison object throws.
//! //!
//! <b>Complexity</b>: N log(a.size() + N) (N has the value source.size()) //! <b>Complexity</b>: N log(size() + N) (N has the value source.size())
template<class C2> template<class C2>
BOOST_CONTAINER_FORCEINLINE void merge(flat_map<Key, T, C2, AllocatorOrContainer>& source) BOOST_CONTAINER_FORCEINLINE void merge(flat_map<Key, T, C2, AllocatorOrContainer>& source)
{ m_flat_tree.merge_unique(source.tree()); } { m_flat_tree.merge_unique(source.tree()); }
@@ -1269,7 +1269,7 @@ class flat_map
&& boost::container::dtl::is_nothrow_swappable<Compare>::value ) && boost::container::dtl::is_nothrow_swappable<Compare>::value )
{ m_flat_tree.swap(x.m_flat_tree); } { m_flat_tree.swap(x.m_flat_tree); }
//! <b>Effects</b>: erase(a.begin(),a.end()). //! <b>Effects</b>: erase(begin(),end()).
//! //!
//! <b>Postcondition</b>: size() == 0. //! <b>Postcondition</b>: size() == 0.
//! //!
@@ -1376,14 +1376,14 @@ class flat_map
{ return m_flat_tree.find(x) != m_flat_tree.end(); } { return m_flat_tree.find(x) != m_flat_tree.end(); }
//! <b>Returns</b>: An iterator pointing to the first element with key not less //! <b>Returns</b>: An iterator pointing to the first element with key not less
//! than k, or a.end() if such an element is not found. //! than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic. //! <b>Complexity</b>: Logarithmic.
BOOST_CONTAINER_FORCEINLINE iterator lower_bound(const key_type& x) BOOST_CONTAINER_FORCEINLINE iterator lower_bound(const key_type& x)
{ return dtl::force_copy<iterator>(m_flat_tree.lower_bound(x)); } { return dtl::force_copy<iterator>(m_flat_tree.lower_bound(x)); }
//! <b>Returns</b>: A const iterator pointing to the first element with key not //! <b>Returns</b>: A const iterator pointing to the first element with key not
//! less than k, or a.end() if such an element is not found. //! less than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic. //! <b>Complexity</b>: Logarithmic.
BOOST_CONTAINER_FORCEINLINE const_iterator lower_bound(const key_type& x) const BOOST_CONTAINER_FORCEINLINE const_iterator lower_bound(const key_type& x) const
@@ -1393,7 +1393,7 @@ class flat_map
//! key_compare::is_transparent exists. //! key_compare::is_transparent exists.
//! //!
//! <b>Returns</b>: An iterator pointing to the first element with key not less //! <b>Returns</b>: An iterator pointing to the first element with key not less
//! than k, or a.end() if such an element is not found. //! than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic. //! <b>Complexity</b>: Logarithmic.
template<class K> template<class K>
@@ -1404,22 +1404,22 @@ class flat_map
//! key_compare::is_transparent exists. //! key_compare::is_transparent exists.
//! //!
//! <b>Returns</b>: A const iterator pointing to the first element with key not //! <b>Returns</b>: A const iterator pointing to the first element with key not
//! less than k, or a.end() if such an element is not found. //! less than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic. //! <b>Complexity</b>: Logarithmic.
template<class K> template<class K>
BOOST_CONTAINER_FORCEINLINE const_iterator lower_bound(const K& x) const BOOST_CONTAINER_FORCEINLINE const_iterator lower_bound(const K& x) const
{ return dtl::force_copy<const_iterator>(m_flat_tree.lower_bound(x)); } { return dtl::force_copy<const_iterator>(m_flat_tree.lower_bound(x)); }
//! <b>Returns</b>: An iterator pointing to the first element with key not less //! <b>Returns</b>: An iterator pointing to the first element with key greater
//! than x, or end() if such an element is not found. //! than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic. //! <b>Complexity</b>: Logarithmic.
BOOST_CONTAINER_FORCEINLINE iterator upper_bound(const key_type& x) BOOST_CONTAINER_FORCEINLINE iterator upper_bound(const key_type& x)
{ return dtl::force_copy<iterator>(m_flat_tree.upper_bound(x)); } { return dtl::force_copy<iterator>(m_flat_tree.upper_bound(x)); }
//! <b>Returns</b>: A const iterator pointing to the first element with key not //! <b>Returns</b>: A const iterator pointing to the first element with key
//! less than x, or end() if such an element is not found. //! greater than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic. //! <b>Complexity</b>: Logarithmic.
BOOST_CONTAINER_FORCEINLINE const_iterator upper_bound(const key_type& x) const BOOST_CONTAINER_FORCEINLINE const_iterator upper_bound(const key_type& x) const
@@ -1428,7 +1428,7 @@ class flat_map
//! <b>Requires</b>: This overload is available only if //! <b>Requires</b>: This overload is available only if
//! key_compare::is_transparent exists. //! key_compare::is_transparent exists.
//! //!
//! <b>Returns</b>: An iterator pointing to the first element with key not less //! <b>Returns</b>: An iterator pointing to the first element with key greater
//! than x, or end() if such an element is not found. //! than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic. //! <b>Complexity</b>: Logarithmic.
@@ -1439,8 +1439,8 @@ class flat_map
//! <b>Requires</b>: This overload is available only if //! <b>Requires</b>: This overload is available only if
//! key_compare::is_transparent exists. //! key_compare::is_transparent exists.
//! //!
//! <b>Returns</b>: A const iterator pointing to the first element with key not //! <b>Returns</b>: A const iterator pointing to the first element with key
//! less than x, or end() if such an element is not found. //! greater than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic. //! <b>Complexity</b>: Logarithmic.
template<class K> template<class K>
@@ -2539,7 +2539,7 @@ class flat_multimap
//! //!
//! <b>Throws</b>: Nothing unless the comparison object throws. //! <b>Throws</b>: Nothing unless the comparison object throws.
//! //!
//! <b>Complexity</b>: N log(a.size() + N) (N has the value source.size()) //! <b>Complexity</b>: N log(size() + N) (N has the value source.size())
template<class C2> template<class C2>
BOOST_CONTAINER_FORCEINLINE void merge(flat_multimap<Key, T, C2, AllocatorOrContainer>& source) BOOST_CONTAINER_FORCEINLINE void merge(flat_multimap<Key, T, C2, AllocatorOrContainer>& source)
{ m_flat_tree.merge_equal(source.tree()); } { m_flat_tree.merge_equal(source.tree()); }
@@ -2609,7 +2609,7 @@ class flat_multimap
&& boost::container::dtl::is_nothrow_swappable<Compare>::value ) && boost::container::dtl::is_nothrow_swappable<Compare>::value )
{ m_flat_tree.swap(x.m_flat_tree); } { m_flat_tree.swap(x.m_flat_tree); }
//! <b>Effects</b>: erase(a.begin(),a.end()). //! <b>Effects</b>: erase(begin(),end()).
//! //!
//! <b>Postcondition</b>: size() == 0. //! <b>Postcondition</b>: size() == 0.
//! //!
@@ -2714,14 +2714,14 @@ class flat_multimap
{ return m_flat_tree.find(x) != m_flat_tree.end(); } { return m_flat_tree.find(x) != m_flat_tree.end(); }
//! <b>Returns</b>: An iterator pointing to the first element with key not less //! <b>Returns</b>: An iterator pointing to the first element with key not less
//! than k, or a.end() if such an element is not found. //! than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
BOOST_CONTAINER_FORCEINLINE iterator lower_bound(const key_type& x) BOOST_CONTAINER_FORCEINLINE iterator lower_bound(const key_type& x)
{ return dtl::force_copy<iterator>(m_flat_tree.lower_bound(x)); } { return dtl::force_copy<iterator>(m_flat_tree.lower_bound(x)); }
//! <b>Returns</b>: An iterator pointing to the first element with key not less //! <b>Returns</b>: An iterator pointing to the first element with key not less
//! than k, or a.end() if such an element is not found. //! than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
BOOST_CONTAINER_FORCEINLINE const_iterator lower_bound(const key_type& x) const BOOST_CONTAINER_FORCEINLINE const_iterator lower_bound(const key_type& x) const
@@ -2731,7 +2731,7 @@ class flat_multimap
//! key_compare::is_transparent exists. //! key_compare::is_transparent exists.
//! //!
//! <b>Returns</b>: An iterator pointing to the first element with key not less //! <b>Returns</b>: An iterator pointing to the first element with key not less
//! than k, or a.end() if such an element is not found. //! than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
template<class K> template<class K>
@@ -2742,14 +2742,14 @@ class flat_multimap
//! key_compare::is_transparent exists. //! key_compare::is_transparent exists.
//! //!
//! <b>Returns</b>: An iterator pointing to the first element with key not less //! <b>Returns</b>: An iterator pointing to the first element with key not less
//! than k, or a.end() if such an element is not found. //! than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
template<class K> template<class K>
BOOST_CONTAINER_FORCEINLINE const_iterator lower_bound(const K& x) const BOOST_CONTAINER_FORCEINLINE const_iterator lower_bound(const K& x) const
{ return dtl::force_copy<const_iterator>(m_flat_tree.lower_bound(x)); } { return dtl::force_copy<const_iterator>(m_flat_tree.lower_bound(x)); }
//! <b>Returns</b>: An iterator pointing to the first element with key not less //! <b>Returns</b>: An iterator pointing to the first element with key greater
//! than x, or end() if such an element is not found. //! than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
@@ -2757,7 +2757,7 @@ class flat_multimap
{return dtl::force_copy<iterator>(m_flat_tree.upper_bound(x)); } {return dtl::force_copy<iterator>(m_flat_tree.upper_bound(x)); }
//! <b>Returns</b>: A const iterator pointing to the first element with key //! <b>Returns</b>: A const iterator pointing to the first element with key
//! not less than x, or end() if such an element is not found. //! greater than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
BOOST_CONTAINER_FORCEINLINE const_iterator upper_bound(const key_type& x) const BOOST_CONTAINER_FORCEINLINE const_iterator upper_bound(const key_type& x) const
@@ -2766,7 +2766,7 @@ class flat_multimap
//! <b>Requires</b>: This overload is available only if //! <b>Requires</b>: This overload is available only if
//! key_compare::is_transparent exists. //! key_compare::is_transparent exists.
//! //!
//! <b>Returns</b>: An iterator pointing to the first element with key not less //! <b>Returns</b>: An iterator pointing to the first element with key greater
//! than x, or end() if such an element is not found. //! than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
@@ -2778,7 +2778,7 @@ class flat_multimap
//! key_compare::is_transparent exists. //! key_compare::is_transparent exists.
//! //!
//! <b>Returns</b>: A const iterator pointing to the first element with key //! <b>Returns</b>: A const iterator pointing to the first element with key
//! not less than x, or end() if such an element is not found. //! greater than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
template<class K> template<class K>

22
include/boost/container/flat_set.hpp
View File

@@ -808,7 +808,7 @@ class flat_set
BOOST_NOEXCEPT_IF( allocator_traits_type::is_always_equal::value BOOST_NOEXCEPT_IF( allocator_traits_type::is_always_equal::value
&& boost::container::dtl::is_nothrow_swappable<Compare>::value ); && boost::container::dtl::is_nothrow_swappable<Compare>::value );
//! <b>Effects</b>: erase(a.begin(),a.end()). //! <b>Effects</b>: erase(begin(),end()).
//! //!
//! <b>Postcondition</b>: size() == 0. //! <b>Postcondition</b>: size() == 0.
//! //!
@@ -948,13 +948,13 @@ class flat_set
bool contains(const K& x) const; bool contains(const K& x) const;
//! <b>Returns</b>: An iterator pointing to the first element with key not less //! <b>Returns</b>: An iterator pointing to the first element with key not less
//! than k, or a.end() if such an element is not found. //! than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
iterator lower_bound(const key_type& x); iterator lower_bound(const key_type& x);
//! <b>Returns</b>: A const iterator pointing to the first element with key not //! <b>Returns</b>: A const iterator pointing to the first element with key not
//! less than k, or a.end() if such an element is not found. //! less than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
const_iterator lower_bound(const key_type& x) const; const_iterator lower_bound(const key_type& x) const;
@@ -963,7 +963,7 @@ class flat_set
//! key_compare::is_transparent exists. //! key_compare::is_transparent exists.
//! //!
//! <b>Returns</b>: An iterator pointing to the first element with key not less //! <b>Returns</b>: An iterator pointing to the first element with key not less
//! than k, or a.end() if such an element is not found. //! than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
template<typename K> template<typename K>
@@ -973,20 +973,20 @@ class flat_set
//! key_compare::is_transparent exists. //! key_compare::is_transparent exists.
//! //!
//! <b>Returns</b>: A const iterator pointing to the first element with key not //! <b>Returns</b>: A const iterator pointing to the first element with key not
//! less than k, or a.end() if such an element is not found. //! less than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
template<typename K> template<typename K>
const_iterator lower_bound(const K& x) const; const_iterator lower_bound(const K& x) const;
//! <b>Returns</b>: An iterator pointing to the first element with key not less //! <b>Returns</b>: An iterator pointing to the first element with key greater
//! than x, or end() if such an element is not found. //! than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
iterator upper_bound(const key_type& x); iterator upper_bound(const key_type& x);
//! <b>Returns</b>: A const iterator pointing to the first element with key not //! <b>Returns</b>: A const iterator pointing to the first element with key
//! less than x, or end() if such an element is not found. //! greater than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
const_iterator upper_bound(const key_type& x) const; const_iterator upper_bound(const key_type& x) const;
@@ -994,7 +994,7 @@ class flat_set
//! <b>Requires</b>: This overload is available only if //! <b>Requires</b>: This overload is available only if
//! key_compare::is_transparent exists. //! key_compare::is_transparent exists.
//! //!
//! <b>Returns</b>: An iterator pointing to the first element with key not less //! <b>Returns</b>: An iterator pointing to the first element with key greater
//! than x, or end() if such an element is not found. //! than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
@@ -1004,8 +1004,8 @@ class flat_set
//! <b>Requires</b>: This overload is available only if //! <b>Requires</b>: This overload is available only if
//! key_compare::is_transparent exists. //! key_compare::is_transparent exists.
//! //!
//! <b>Returns</b>: A const iterator pointing to the first element with key not //! <b>Returns</b>: A const iterator pointing to the first element with key
//! less than x, or end() if such an element is not found. //! greater than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
template<typename K> template<typename K>

48
include/boost/container/map.hpp
View File

@@ -993,7 +993,7 @@ class map
//! //!
//! <b>Returns</b>: A node_type owning the element if found, otherwise an empty node_type. //! <b>Returns</b>: A node_type owning the element if found, otherwise an empty node_type.
//! //!
//! <b>Complexity</b>: log(a.size()). //! <b>Complexity</b>: log(size()).
node_type extract(const key_type& k) node_type extract(const key_type& k)
{ {
typename base_t::node_type base_nh(this->base_t::extract(k)); typename base_t::node_type base_nh(this->base_t::extract(k));
@@ -1026,7 +1026,7 @@ class map
//! //!
//! <b>Throws</b>: Nothing unless the comparison object throws. //! <b>Throws</b>: Nothing unless the comparison object throws.
//! //!
//! <b>Complexity</b>: N log(a.size() + N) (N has the value source.size()) //! <b>Complexity</b>: N log(size() + N) (N has the value source.size())
template<class C2> template<class C2>
BOOST_CONTAINER_FORCEINLINE void merge(map<Key, T, C2, Allocator, Options>& source) BOOST_CONTAINER_FORCEINLINE void merge(map<Key, T, C2, Allocator, Options>& source)
{ {
@@ -1064,7 +1064,7 @@ class map
BOOST_NOEXCEPT_IF( allocator_traits_type::is_always_equal::value BOOST_NOEXCEPT_IF( allocator_traits_type::is_always_equal::value
&& boost::container::dtl::is_nothrow_swappable<Compare>::value ) && boost::container::dtl::is_nothrow_swappable<Compare>::value )
//! <b>Effects</b>: erase(a.begin(),a.end()). //! <b>Effects</b>: erase(begin(),end()).
//! //!
//! <b>Postcondition</b>: size() == 0. //! <b>Postcondition</b>: size() == 0.
//! //!
@@ -1152,13 +1152,13 @@ class map
bool contains(const K& x) const; bool contains(const K& x) const;
//! <b>Returns</b>: An iterator pointing to the first element with key not less //! <b>Returns</b>: An iterator pointing to the first element with key not less
//! than k, or a.end() if such an element is not found. //! than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
iterator lower_bound(const key_type& x); iterator lower_bound(const key_type& x);
//! <b>Returns</b>: A const iterator pointing to the first element with key not //! <b>Returns</b>: A const iterator pointing to the first element with key not
//! less than k, or a.end() if such an element is not found. //! less than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
const_iterator lower_bound(const key_type& x) const; const_iterator lower_bound(const key_type& x) const;
@@ -1167,7 +1167,7 @@ class map
//! key_compare::is_transparent exists. //! key_compare::is_transparent exists.
//! //!
//! <b>Returns</b>: An iterator pointing to the first element with key not less //! <b>Returns</b>: An iterator pointing to the first element with key not less
//! than k, or a.end() if such an element is not found. //! than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
template<typename K> template<typename K>
@@ -1177,20 +1177,20 @@ class map
//! key_compare::is_transparent exists. //! key_compare::is_transparent exists.
//! //!
//! <b>Returns</b>: A const iterator pointing to the first element with key not //! <b>Returns</b>: A const iterator pointing to the first element with key not
//! less than k, or a.end() if such an element is not found. //! less than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
template<typename K> template<typename K>
const_iterator lower_bound(const K& x) const; const_iterator lower_bound(const K& x) const;
//! <b>Returns</b>: An iterator pointing to the first element with key not less //! <b>Returns</b>: An iterator pointing to the first element with key greater
//! than x, or end() if such an element is not found. //! than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
iterator upper_bound(const key_type& x); iterator upper_bound(const key_type& x);
//! <b>Returns</b>: A const iterator pointing to the first element with key not //! <b>Returns</b>: A const iterator pointing to the first element with key
//! less than x, or end() if such an element is not found. //! greater than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
const_iterator upper_bound(const key_type& x) const; const_iterator upper_bound(const key_type& x) const;
@@ -1198,7 +1198,7 @@ class map
//! <b>Requires</b>: This overload is available only if //! <b>Requires</b>: This overload is available only if
//! key_compare::is_transparent exists. //! key_compare::is_transparent exists.
//! //!
//! <b>Returns</b>: An iterator pointing to the first element with key not less //! <b>Returns</b>: An iterator pointing to the first element with key greater
//! than x, or end() if such an element is not found. //! than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
@@ -1208,8 +1208,8 @@ class map
//! <b>Requires</b>: This overload is available only if //! <b>Requires</b>: This overload is available only if
//! key_compare::is_transparent exists. //! key_compare::is_transparent exists.
//! //!
//! <b>Returns</b>: A const iterator pointing to the first element with key not //! <b>Returns</b>: A const iterator pointing to the first element with key
//! less than x, or end() if such an element is not found. //! greater than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
template<typename K> template<typename K>
@@ -1981,7 +1981,7 @@ class multimap
//! //!
//! <b>Throws</b>: Nothing unless the comparison object throws. //! <b>Throws</b>: Nothing unless the comparison object throws.
//! //!
//! <b>Complexity</b>: N log(a.size() + N) (N has the value source.size()) //! <b>Complexity</b>: N log(size() + N) (N has the value source.size())
template<class C2> template<class C2>
BOOST_CONTAINER_FORCEINLINE void merge(multimap<Key, T, C2, Allocator, Options>& source) BOOST_CONTAINER_FORCEINLINE void merge(multimap<Key, T, C2, Allocator, Options>& source)
{ {
@@ -2087,13 +2087,13 @@ class multimap
bool contains(const K& x) const; bool contains(const K& x) const;
//! <b>Returns</b>: An iterator pointing to the first element with key not less //! <b>Returns</b>: An iterator pointing to the first element with key not less
//! than k, or a.end() if such an element is not found. //! than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
iterator lower_bound(const key_type& x); iterator lower_bound(const key_type& x);
//! <b>Returns</b>: A const iterator pointing to the first element with key not //! <b>Returns</b>: A const iterator pointing to the first element with key not
//! less than k, or a.end() if such an element is not found. //! less than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
const_iterator lower_bound(const key_type& x) const; const_iterator lower_bound(const key_type& x) const;
@@ -2102,7 +2102,7 @@ class multimap
//! key_compare::is_transparent exists. //! key_compare::is_transparent exists.
//! //!
//! <b>Returns</b>: An iterator pointing to the first element with key not less //! <b>Returns</b>: An iterator pointing to the first element with key not less
//! than k, or a.end() if such an element is not found. //! than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
template<typename K> template<typename K>
@@ -2112,20 +2112,20 @@ class multimap
//! key_compare::is_transparent exists. //! key_compare::is_transparent exists.
//! //!
//! <b>Returns</b>: A const iterator pointing to the first element with key not //! <b>Returns</b>: A const iterator pointing to the first element with key not
//! less than k, or a.end() if such an element is not found. //! less than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
template<typename K> template<typename K>
const_iterator lower_bound(const K& x) const; const_iterator lower_bound(const K& x) const;
//! <b>Returns</b>: An iterator pointing to the first element with key not less //! <b>Returns</b>: An iterator pointing to the first element with key greater
//! than x, or end() if such an element is not found. //! than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
iterator upper_bound(const key_type& x); iterator upper_bound(const key_type& x);
//! <b>Returns</b>: A const iterator pointing to the first element with key not //! <b>Returns</b>: A const iterator pointing to the first element with key
//! less than x, or end() if such an element is not found. //! greater than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
const_iterator upper_bound(const key_type& x) const; const_iterator upper_bound(const key_type& x) const;
@@ -2133,7 +2133,7 @@ class multimap
//! <b>Requires</b>: This overload is available only if //! <b>Requires</b>: This overload is available only if
//! key_compare::is_transparent exists. //! key_compare::is_transparent exists.
//! //!
//! <b>Returns</b>: An iterator pointing to the first element with key not less //! <b>Returns</b>: An iterator pointing to the first element with key greater
//! than x, or end() if such an element is not found. //! than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
@@ -2143,8 +2143,8 @@ class multimap
//! <b>Requires</b>: This overload is available only if //! <b>Requires</b>: This overload is available only if
//! key_compare::is_transparent exists. //! key_compare::is_transparent exists.
//! //!
//! <b>Returns</b>: A const iterator pointing to the first element with key not //! <b>Returns</b>: A const iterator pointing to the first element with key
//! less than x, or end() if such an element is not found. //! greater than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
template<typename K> template<typename K>

22
include/boost/container/set.hpp
View File

@@ -718,7 +718,7 @@ class set
BOOST_NOEXCEPT_IF( allocator_traits_type::is_always_equal::value BOOST_NOEXCEPT_IF( allocator_traits_type::is_always_equal::value
&& boost::container::dtl::is_nothrow_swappable<Compare>::value ); && boost::container::dtl::is_nothrow_swappable<Compare>::value );
//! <b>Effects</b>: erase(a.begin(),a.end()). //! <b>Effects</b>: erase(begin(),end()).
//! //!
//! <b>Postcondition</b>: size() == 0. //! <b>Postcondition</b>: size() == 0.
//! //!
@@ -806,13 +806,13 @@ class set
bool contains(const K& x) const; bool contains(const K& x) const;
//! <b>Returns</b>: An iterator pointing to the first element with key not less //! <b>Returns</b>: An iterator pointing to the first element with key not less
//! than k, or a.end() if such an element is not found. //! than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
iterator lower_bound(const key_type& x); iterator lower_bound(const key_type& x);
//! <b>Returns</b>: A const iterator pointing to the first element with key not //! <b>Returns</b>: A const iterator pointing to the first element with key not
//! less than k, or a.end() if such an element is not found. //! less than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
const_iterator lower_bound(const key_type& x) const; const_iterator lower_bound(const key_type& x) const;
@@ -821,7 +821,7 @@ class set
//! key_compare::is_transparent exists. //! key_compare::is_transparent exists.
//! //!
//! <b>Returns</b>: An iterator pointing to the first element with key not less //! <b>Returns</b>: An iterator pointing to the first element with key not less
//! than k, or a.end() if such an element is not found. //! than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
template<typename K> template<typename K>
@@ -831,20 +831,20 @@ class set
//! key_compare::is_transparent exists. //! key_compare::is_transparent exists.
//! //!
//! <b>Returns</b>: A const iterator pointing to the first element with key not //! <b>Returns</b>: A const iterator pointing to the first element with key not
//! less than k, or a.end() if such an element is not found. //! less than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
template<typename K> template<typename K>
const_iterator lower_bound(const K& x) const; const_iterator lower_bound(const K& x) const;
//! <b>Returns</b>: An iterator pointing to the first element with key not less //! <b>Returns</b>: An iterator pointing to the first element with key greater
//! than x, or end() if such an element is not found. //! than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
iterator upper_bound(const key_type& x); iterator upper_bound(const key_type& x);
//! <b>Returns</b>: A const iterator pointing to the first element with key not //! <b>Returns</b>: A const iterator pointing to the first element with key
//! less than x, or end() if such an element is not found. //! greater than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
const_iterator upper_bound(const key_type& x) const; const_iterator upper_bound(const key_type& x) const;
@@ -852,7 +852,7 @@ class set
//! <b>Requires</b>: This overload is available only if //! <b>Requires</b>: This overload is available only if
//! key_compare::is_transparent exists. //! key_compare::is_transparent exists.
//! //!
//! <b>Returns</b>: An iterator pointing to the first element with key not less //! <b>Returns</b>: An iterator pointing to the first element with key greater
//! than x, or end() if such an element is not found. //! than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
@@ -862,8 +862,8 @@ class set
//! <b>Requires</b>: This overload is available only if //! <b>Requires</b>: This overload is available only if
//! key_compare::is_transparent exists. //! key_compare::is_transparent exists.
//! //!
//! <b>Returns</b>: A const iterator pointing to the first element with key not //! <b>Returns</b>: A const iterator pointing to the first element with key
//! less than x, or end() if such an element is not found. //! greater than x, or end() if such an element is not found.
//! //!
//! <b>Complexity</b>: Logarithmic //! <b>Complexity</b>: Logarithmic
template<typename K> template<typename K>