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

Clean up the hash table implementation comments a little.

Browse Source 
[SVN r41783]
This commit is contained in:
Daniel James
2007-12-06 11:43:14 +00:00
parent 6e8f9e1c67
commit 2d8a64d88f
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

@@ -620,7 +620,7 @@ namespace boost {
if(n->group_prev_ == *pos) { if(n->group_prev_ == *pos) {
// The deleted node is the sole node in the group, so // The deleted node is the sole node in the group, so
// no need to unlink it from a goup. // no need to unlink it from a group.
} }
else if(BOOST_HASH_BORLAND_BOOL(next) && prev_in_group(next) == *pos) else if(BOOST_HASH_BORLAND_BOOL(next) && prev_in_group(next) == *pos)
{ {
@@ -630,8 +630,8 @@ namespace boost {
} }
else { else {
// The deleted node is at the end of the group, so the // The deleted node is at the end of the group, so the
// node in the group pointing to it is at the beginning // first node in the group is pointing to it.
// of the group. Find that to change its pointer. // Find that to change its pointer.
link_ptr it = n->group_prev_; link_ptr it = n->group_prev_;
while(prev_in_group(it) != *pos) { while(prev_in_group(it) != *pos) {
it = prev_in_group(it); it = prev_in_group(it);
@@ -699,7 +699,7 @@ namespace boost {
} }
#if BOOST_UNORDERED_HASH_EQUIVALENT #if BOOST_UNORDERED_HASH_EQUIVALENT
// Break a ciruclar list into two, with split as the beginneing // Break a ciruclar list into two, with split as the beginning
// of the second group (if split is at the beginning then don't // of the second group (if split is at the beginning then don't
// split). // split).
link_ptr split_group(link_ptr split) link_ptr split_group(link_ptr split)