From 28cdebe7a41ebfe939ccaa0b5f840ebb6fea0b4c Mon Sep 17 00:00:00 2001 From: Daniel James Date: Mon, 29 Aug 2011 17:14:09 +0000 Subject: [PATCH] Unordered: Update erase reference. [SVN r74142] --- doc/ref.php | 10 ++++------ doc/ref.xml | 40 ++++++++++++++++------------------------ 2 files changed, 20 insertions(+), 30 deletions(-) diff --git a/doc/ref.php b/doc/ref.php index b32215d0..b312f2d4 100644 --- a/doc/ref.php +++ b/doc/ref.php @@ -555,15 +555,13 @@ EOL; Only throws an exception if it is thrown by hasher or key_equal. - In this implementation, this overload doesn't call either function object's methods so it is no throw, but this might not be true in other implementations. - When the number of elements is a lot smaller than the number of buckets - this function can be very inefficient as it has to search through empty - buckets for the next element, in order to return the iterator. - The method quick_erase is faster, but has yet - to be standardized. + In older versions this could be inefficient because it had to search + through several buckets to find the position of the returned iterator. + The data structure has been changed so that this is no longer the case, + and the alternative erase methods have been deprecated. diff --git a/doc/ref.xml b/doc/ref.xml index 012cea7f..449121e1 100644 --- a/doc/ref.xml +++ b/doc/ref.xml @@ -471,15 +471,13 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) Only throws an exception if it is thrown by hasher or key_equal. - In this implementation, this overload doesn't call either function object's methods so it is no throw, but this might not be true in other implementations. - When the number of elements is a lot smaller than the number of buckets - this function can be very inefficient as it has to search through empty - buckets for the next element, in order to return the iterator. - The method quick_erase is faster, but has yet - to be standardized. + In older versions this could be inefficient because it had to search + through several buckets to find the position of the returned iterator. + The data structure has been changed so that this is no longer the case, + and the alternative erase methods have been deprecated. @@ -1371,15 +1369,13 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) Only throws an exception if it is thrown by hasher or key_equal. - In this implementation, this overload doesn't call either function object's methods so it is no throw, but this might not be true in other implementations. - When the number of elements is a lot smaller than the number of buckets - this function can be very inefficient as it has to search through empty - buckets for the next element, in order to return the iterator. - The method quick_erase is faster, but has yet - to be standardized. + In older versions this could be inefficient because it had to search + through several buckets to find the position of the returned iterator. + The data structure has been changed so that this is no longer the case, + and the alternative erase methods have been deprecated. @@ -2285,15 +2281,13 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) Only throws an exception if it is thrown by hasher or key_equal. - In this implementation, this overload doesn't call either function object's methods so it is no throw, but this might not be true in other implementations. - When the number of elements is a lot smaller than the number of buckets - this function can be very inefficient as it has to search through empty - buckets for the next element, in order to return the iterator. - The method quick_erase is faster, but has yet - to be standardized. + In older versions this could be inefficient because it had to search + through several buckets to find the position of the returned iterator. + The data structure has been changed so that this is no longer the case, + and the alternative erase methods have been deprecated. @@ -3234,15 +3228,13 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) Only throws an exception if it is thrown by hasher or key_equal. - In this implementation, this overload doesn't call either function object's methods so it is no throw, but this might not be true in other implementations. - When the number of elements is a lot smaller than the number of buckets - this function can be very inefficient as it has to search through empty - buckets for the next element, in order to return the iterator. - The method quick_erase is faster, but has yet - to be standardized. + In older versions this could be inefficient because it had to search + through several buckets to find the position of the returned iterator. + The data structure has been changed so that this is no longer the case, + and the alternative erase methods have been deprecated.