aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorPaolo Carlini <paolo.carlini@oracle.com>2011-07-24 19:47:04 +0000
committerPaolo Carlini <paolo@gcc.gnu.org>2011-07-24 19:47:04 +0000
commit73645647f97029a05b08bdb5077d5da1592e088e (patch)
tree19e2b5064d87b7418a0c65976b43ec31e020d7f3
parent4f7b188f20a89a28a72f702b4d34b82894a1dd5f (diff)
downloadgcc-73645647f97029a05b08bdb5077d5da1592e088e.zip
gcc-73645647f97029a05b08bdb5077d5da1592e088e.tar.gz
gcc-73645647f97029a05b08bdb5077d5da1592e088e.tar.bz2
hashtable_policy.h (_Prime_rehash_policy::_M_next_bkt, [...]): Fix typos in the last commit.
2011-07-24 Paolo Carlini <paolo.carlini@oracle.com> * include/bits/hashtable_policy.h (_Prime_rehash_policy::_M_next_bkt, _M_bkt_for_elements, _M_need_rehash): Fix typos in the last commit. From-SVN: r176718
-rw-r--r--libstdc++-v3/ChangeLog5
-rw-r--r--libstdc++-v3/include/bits/hashtable_policy.h6
2 files changed, 8 insertions, 3 deletions
diff --git a/libstdc++-v3/ChangeLog b/libstdc++-v3/ChangeLog
index 30b954e..9130181 100644
--- a/libstdc++-v3/ChangeLog
+++ b/libstdc++-v3/ChangeLog
@@ -1,3 +1,8 @@
+2011-07-24 Paolo Carlini <paolo.carlini@oracle.com>
+
+ * include/bits/hashtable_policy.h (_Prime_rehash_policy::_M_next_bkt,
+ _M_bkt_for_elements, _M_need_rehash): Fix typos in the last commit.
+
2011-07-24 François Dumont <francois.cppdevs@free.fr>
* include/bits/hashtable_policy.h (_Prime_rehash_policy): Use
diff --git a/libstdc++-v3/include/bits/hashtable_policy.h b/libstdc++-v3/include/bits/hashtable_policy.h
index df17855..ab34463 100644
--- a/libstdc++-v3/include/bits/hashtable_policy.h
+++ b/libstdc++-v3/include/bits/hashtable_policy.h
@@ -431,7 +431,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
+ _S_n_primes, __n);
_M_next_resize =
static_cast<std::size_t>(__builtin_floor(__p * _M_max_load_factor));
- return *__p;
+ return __p;
}
// Return the smallest prime p such that alpha p >= n, where alpha
@@ -445,7 +445,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
+ _S_n_primes, __min_bkts);
_M_next_resize =
static_cast<std::size_t>(__builtin_floor(__p * _M_max_load_factor));
- return *__p;
+ return __p;
}
// Finds the smallest prime p such that alpha p > __n_elt + __n_ins.
@@ -474,7 +474,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
__min_bkts);
_M_next_resize = static_cast<std::size_t>
(__builtin_floor(__p * _M_max_load_factor));
- return std::make_pair(true, *__p);
+ return std::make_pair(true, __p);
}
else
{