Unordered: Get rid of buckets.

[SVN r80385]
This commit is contained in:
Daniel James committed 2012-09-03 20:04:15 +00:00
1 parent 45b6340a98
commit a1bdd82bd5
4 files changed
+397 -453

No files matched your search

+3 -4
View File
@@ -173,7 +173,6 @@ namespace boost { namespace unordered { namespace detail {
typedef boost::unordered::detail::table<Types> table;
typedef typename table::value_type value_type;
typedef typename table::bucket bucket;
typedef typename table::buckets buckets;
typedef typename table::policy policy;
typedef typename table::node_pointer node_pointer;
typedef typename table::node_allocator node_allocator;
@@ -619,7 +618,7 @@ namespace boost { namespace unordered { namespace detail {
// fill_buckets
template <class NodeCreator>
static void fill_buckets(iterator n, buckets& dst,
static void fill_buckets(iterator n, table& dst,
NodeCreator& creator)
{
previous_pointer prev = dst.get_previous_start();
@@ -648,12 +647,12 @@ namespace boost { namespace unordered { namespace detail {
// Iterate through the nodes placing them in the correct buckets.
// pre: prev->next_ is not null.
static previous_pointer place_in_bucket(buckets& dst,
static previous_pointer place_in_bucket(table& dst,
previous_pointer prev)
{
node_pointer n = static_cast<node_pointer>(prev->next_);
bucket_pointer b = dst.get_bucket(
buckets::to_bucket(dst.bucket_count_, n->hash_));
table::to_bucket(dst.bucket_count_, n->hash_));
if (!b->next_) {
b->next_ = prev;