boostorg/unordered
1
0
Fork 1
mirror of https://github.com/boostorg/unordered.git synced 2025-07-31 11:57:15 +02:00
Code Issues Packages Projects Releases Wiki Activity

Pull another node_constructor out of a loop.

Browse Source 
[SVN r42159]
This commit is contained in:
Daniel James
2007-12-18 23:50:29 +00:00
parent 072a80a3f2
commit a356c67c38
1 changed files with 2 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
include/boost/unordered/detail/hash_table_impl.hpp
View File

@@ -1718,8 +1718,8 @@ namespace boost {
template <typename InputIterator> template <typename InputIterator>
void insert(InputIterator i, InputIterator j) void insert(InputIterator i, InputIterator j)
{ {
// If only inserting 1 element, get the required node_constructor a(this->allocators_);
// safety since insert is only called once.
for (; i != j; ++i) { for (; i != j; ++i) {
// No side effects in this initial code // No side effects in this initial code
size_type hash_value = hash_function()(extract_key(*i)); size_type hash_value = hash_function()(extract_key(*i));
@@ -1733,7 +1733,6 @@ namespace boost {
// Create the node before rehashing in case it throws an // Create the node before rehashing in case it throws an
// exception (need strong safety in such a case). // exception (need strong safety in such a case).
node_constructor a(this->allocators_);
value_type const& v = *i; value_type const& v = *i;
a.construct(v); a.construct(v);