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

Fixed for intel strict mode.

Browse Source 
[SVN r3736]
This commit is contained in:
Daniel James
2007-02-25 21:09:38 +00:00
parent 12f1e037a8
commit 8d31c94d9a
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -1644,9 +1644,9 @@ namespace boost {
local_iterator_base position = find_iterator(bucket, k); local_iterator_base position = find_iterator(bucket, k);
if(position.not_finished()) if(position.not_finished())
link_node(a.release(), position); this->link_node(a.release(), position);
else else
link_node(a.release(), bucket); this->link_node(a.release(), bucket);
} }
} }
} }
@ -1856,7 +1856,7 @@ namespace boost {
size_type count(key_type const& k) const size_type count(key_type const& k) const
{ {
local_iterator_base it = find_iterator(k); // throws, strong local_iterator_base it = find_iterator(k); // throws, strong
return it.not_finished() ? group_count(it) : 0; return it.not_finished() ? this->group_count(it) : 0;
} }
// find // find
@ -1882,7 +1882,7 @@ namespace boost {
local_iterator_base it = find_iterator(bucket, k); local_iterator_base it = find_iterator(bucket, k);
if (it.not_finished()) { if (it.not_finished()) {
iterator_base first(iterator_base(bucket, it)); iterator_base first(iterator_base(bucket, it));
iterator_base second(iterator_base(bucket, last_in_group(it.node_))); iterator_base second(iterator_base(bucket, this->last_in_group(it.node_)));
second.increment(); second.increment();
return std::pair<iterator_base, iterator_base>(first, second); return std::pair<iterator_base, iterator_base>(first, second);
} }