|
Boost-Commit : |
From: daniel_james_at_[hidden]
Date: 2007-12-06 06:43:14
Author: danieljames
Date: 2007-12-06 06:43:14 EST (Thu, 06 Dec 2007)
New Revision: 41783
URL: http://svn.boost.org/trac/boost/changeset/41783
Log:
Clean up the hash table implementation comments a little.
Text files modified:
sandbox/unordered/boost/unordered/detail/hash_table_impl.hpp | 8 ++++----
1 files changed, 4 insertions(+), 4 deletions(-)
Modified: sandbox/unordered/boost/unordered/detail/hash_table_impl.hpp
==============================================================================
--- sandbox/unordered/boost/unordered/detail/hash_table_impl.hpp (original)
+++ sandbox/unordered/boost/unordered/detail/hash_table_impl.hpp 2007-12-06 06:43:14 EST (Thu, 06 Dec 2007)
@@ -620,7 +620,7 @@
if(n->group_prev_ == *pos) {
// 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)
{
@@ -630,8 +630,8 @@
}
else {
// The deleted node is at the end of the group, so the
- // node in the group pointing to it is at the beginning
- // of the group. Find that to change its pointer.
+ // first node in the group is pointing to it.
+ // Find that to change its pointer.
link_ptr it = n->group_prev_;
while(prev_in_group(it) != *pos) {
it = prev_in_group(it);
@@ -699,7 +699,7 @@
}
#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
// split).
link_ptr split_group(link_ptr split)
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk