Chris@16: 
Chris@16: // Copyright (C) 2003-2004 Jeremy B. Maitin-Shepard.
Chris@16: // Copyright (C) 2005-2011 Daniel James
Chris@16: // Distributed under the Boost Software License, Version 1.0. (See accompanying
Chris@16: // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
Chris@16: 
Chris@16: #ifndef BOOST_UNORDERED_DETAIL_UNIQUE_HPP_INCLUDED
Chris@16: #define BOOST_UNORDERED_DETAIL_UNIQUE_HPP_INCLUDED
Chris@16: 
Chris@101: #include <boost/config.hpp>
Chris@101: #if defined(BOOST_HAS_PRAGMA_ONCE)
Chris@101: #pragma once
Chris@16: #endif
Chris@16: 
Chris@16: #include <boost/unordered/detail/table.hpp>
Chris@16: #include <boost/unordered/detail/extract_key.hpp>
Chris@16: #include <boost/throw_exception.hpp>
Chris@16: #include <stdexcept>
Chris@16: 
Chris@16: namespace boost { namespace unordered { namespace detail {
Chris@16: 
Chris@16:     template <typename A, typename T> struct unique_node;
Chris@16:     template <typename T> struct ptr_node;
Chris@16:     template <typename Types> struct table_impl;
Chris@16: 
Chris@16:     template <typename A, typename T>
Chris@16:     struct unique_node :
Chris@16:         boost::unordered::detail::value_base<T>
Chris@16:     {
Chris@16:         typedef typename ::boost::unordered::detail::rebind_wrap<
Chris@101:             A, unique_node<A, T> >::type allocator;
Chris@101:         typedef typename ::boost::unordered::detail::
Chris@101:             allocator_traits<allocator>::pointer node_pointer;
Chris@16:         typedef node_pointer link_pointer;
Chris@16: 
Chris@16:         link_pointer next_;
Chris@16:         std::size_t hash_;
Chris@16: 
Chris@16:         unique_node() :
Chris@16:             next_(),
Chris@16:             hash_(0)
Chris@16:         {}
Chris@16: 
Chris@16:         void init(node_pointer)
Chris@16:         {
Chris@16:         }
Chris@16: 
Chris@16:     private:
Chris@16:         unique_node& operator=(unique_node const&);
Chris@16:     };
Chris@16: 
Chris@16:     template <typename T>
Chris@16:     struct ptr_node :
Chris@16:         boost::unordered::detail::ptr_bucket
Chris@16:     {
Chris@101:         typedef T value_type;
Chris@16:         typedef boost::unordered::detail::ptr_bucket bucket_base;
Chris@16:         typedef ptr_node<T>* node_pointer;
Chris@16:         typedef ptr_bucket* link_pointer;
Chris@16: 
Chris@16:         std::size_t hash_;
Chris@101:         boost::unordered::detail::value_base<T> value_base_;
Chris@16: 
Chris@16:         ptr_node() :
Chris@16:             bucket_base(),
Chris@16:             hash_(0)
Chris@16:         {}
Chris@16: 
Chris@16:         void init(node_pointer)
Chris@16:         {
Chris@16:         }
Chris@16: 
Chris@101:         void* address() { return value_base_.address(); }
Chris@101:         value_type& value() { return value_base_.value(); }
Chris@101:         value_type* value_ptr() { return value_base_.value_ptr(); }
Chris@101: 
Chris@16:     private:
Chris@16:         ptr_node& operator=(ptr_node const&);
Chris@16:     };
Chris@16: 
Chris@16:     // If the allocator uses raw pointers use ptr_node
Chris@16:     // Otherwise use node.
Chris@16: 
Chris@16:     template <typename A, typename T, typename NodePtr, typename BucketPtr>
Chris@16:     struct pick_node2
Chris@16:     {
Chris@16:         typedef boost::unordered::detail::unique_node<A, T> node;
Chris@16: 
Chris@16:         typedef typename boost::unordered::detail::allocator_traits<
Chris@16:             typename boost::unordered::detail::rebind_wrap<A, node>::type
Chris@16:         >::pointer node_pointer;
Chris@16: 
Chris@16:         typedef boost::unordered::detail::bucket<node_pointer> bucket;
Chris@16:         typedef node_pointer link_pointer;
Chris@16:     };
Chris@16: 
Chris@16:     template <typename A, typename T>
Chris@16:     struct pick_node2<A, T,
Chris@16:         boost::unordered::detail::ptr_node<T>*,
Chris@16:         boost::unordered::detail::ptr_bucket*>
Chris@16:     {
Chris@16:         typedef boost::unordered::detail::ptr_node<T> node;
Chris@16:         typedef boost::unordered::detail::ptr_bucket bucket;
Chris@16:         typedef bucket* link_pointer;
Chris@16:     };
Chris@16: 
Chris@16:     template <typename A, typename T>
Chris@16:     struct pick_node
Chris@16:     {
Chris@16:         typedef boost::unordered::detail::allocator_traits<
Chris@16:             typename boost::unordered::detail::rebind_wrap<A,
Chris@16:                 boost::unordered::detail::ptr_node<T> >::type
Chris@16:         > tentative_node_traits;
Chris@16: 
Chris@16:         typedef boost::unordered::detail::allocator_traits<
Chris@16:             typename boost::unordered::detail::rebind_wrap<A,
Chris@16:                 boost::unordered::detail::ptr_bucket >::type
Chris@16:         > tentative_bucket_traits;
Chris@16: 
Chris@16:         typedef pick_node2<A, T,
Chris@16:             typename tentative_node_traits::pointer,
Chris@16:             typename tentative_bucket_traits::pointer> pick;
Chris@16: 
Chris@16:         typedef typename pick::node node;
Chris@16:         typedef typename pick::bucket bucket;
Chris@16:         typedef typename pick::link_pointer link_pointer;
Chris@16:     };
Chris@16: 
Chris@16:     template <typename A, typename T, typename H, typename P>
Chris@16:     struct set
Chris@16:     {
Chris@16:         typedef boost::unordered::detail::set<A, T, H, P> types;
Chris@16: 
Chris@16:         typedef A allocator;
Chris@16:         typedef T value_type;
Chris@16:         typedef H hasher;
Chris@16:         typedef P key_equal;
Chris@16:         typedef T key_type;
Chris@16: 
Chris@16:         typedef boost::unordered::detail::allocator_traits<allocator> traits;
Chris@16:         typedef boost::unordered::detail::pick_node<allocator, value_type> pick;
Chris@16:         typedef typename pick::node node;
Chris@16:         typedef typename pick::bucket bucket;
Chris@16:         typedef typename pick::link_pointer link_pointer;
Chris@16: 
Chris@16:         typedef boost::unordered::detail::table_impl<types> table;
Chris@16:         typedef boost::unordered::detail::set_extractor<value_type> extractor;
Chris@16: 
Chris@101:         typedef typename boost::unordered::detail::pick_policy<T>::type policy;
Chris@16:     };
Chris@16: 
Chris@16:     template <typename A, typename K, typename M, typename H, typename P>
Chris@16:     struct map
Chris@16:     {
Chris@16:         typedef boost::unordered::detail::map<A, K, M, H, P> types;
Chris@16: 
Chris@16:         typedef A allocator;
Chris@16:         typedef std::pair<K const, M> value_type;
Chris@16:         typedef H hasher;
Chris@16:         typedef P key_equal;
Chris@16:         typedef K key_type;
Chris@16: 
Chris@16:         typedef boost::unordered::detail::allocator_traits<allocator>
Chris@16:             traits;
Chris@16:         typedef boost::unordered::detail::pick_node<allocator, value_type> pick;
Chris@16:         typedef typename pick::node node;
Chris@16:         typedef typename pick::bucket bucket;
Chris@16:         typedef typename pick::link_pointer link_pointer;
Chris@16: 
Chris@16:         typedef boost::unordered::detail::table_impl<types> table;
Chris@16:         typedef boost::unordered::detail::map_extractor<key_type, value_type>
Chris@16:             extractor;
Chris@16: 
Chris@101:         typedef typename boost::unordered::detail::pick_policy<K>::type policy;
Chris@16:     };
Chris@16: 
Chris@16:     template <typename Types>
Chris@16:     struct table_impl : boost::unordered::detail::table<Types>
Chris@16:     {
Chris@16:         typedef boost::unordered::detail::table<Types> table;
Chris@16:         typedef typename table::value_type value_type;
Chris@16:         typedef typename table::bucket bucket;
Chris@16:         typedef typename table::policy policy;
Chris@16:         typedef typename table::node_pointer node_pointer;
Chris@16:         typedef typename table::node_allocator node_allocator;
Chris@16:         typedef typename table::node_allocator_traits node_allocator_traits;
Chris@16:         typedef typename table::bucket_pointer bucket_pointer;
Chris@16:         typedef typename table::link_pointer link_pointer;
Chris@16:         typedef typename table::hasher hasher;
Chris@16:         typedef typename table::key_equal key_equal;
Chris@16:         typedef typename table::key_type key_type;
Chris@16:         typedef typename table::node_constructor node_constructor;
Chris@16:         typedef typename table::extractor extractor;
Chris@16:         typedef typename table::iterator iterator;
Chris@16:         typedef typename table::c_iterator c_iterator;
Chris@16: 
Chris@16:         typedef std::pair<iterator, bool> emplace_return;
Chris@16: 
Chris@16:         // Constructors
Chris@16: 
Chris@16:         table_impl(std::size_t n,
Chris@16:                 hasher const& hf,
Chris@16:                 key_equal const& eq,
Chris@16:                 node_allocator const& a)
Chris@16:           : table(n, hf, eq, a)
Chris@16:         {}
Chris@16: 
Chris@16:         table_impl(table_impl const& x)
Chris@16:           : table(x, node_allocator_traits::
Chris@16:                 select_on_container_copy_construction(x.node_alloc()))
Chris@16:         {
Chris@16:             this->init(x);
Chris@16:         }
Chris@16: 
Chris@16:         table_impl(table_impl const& x,
Chris@16:                 node_allocator const& a)
Chris@16:           : table(x, a)
Chris@16:         {
Chris@16:             this->init(x);
Chris@16:         }
Chris@16: 
Chris@16:         table_impl(table_impl& x,
Chris@16:                 boost::unordered::detail::move_tag m)
Chris@16:           : table(x, m)
Chris@16:         {}
Chris@16: 
Chris@16:         table_impl(table_impl& x,
Chris@16:                 node_allocator const& a,
Chris@16:                 boost::unordered::detail::move_tag m)
Chris@16:           : table(x, a, m)
Chris@16:         {
Chris@16:             this->move_init(x);
Chris@16:         }
Chris@16: 
Chris@16:         // Accessors
Chris@16: 
Chris@16:         template <class Key, class Pred>
Chris@16:         iterator find_node_impl(
Chris@16:                 std::size_t key_hash,
Chris@16:                 Key const& k,
Chris@16:                 Pred const& eq) const
Chris@16:         {
Chris@16:             std::size_t bucket_index = this->hash_to_bucket(key_hash);
Chris@16:             iterator n = this->begin(bucket_index);
Chris@16: 
Chris@16:             for (;;)
Chris@16:             {
Chris@16:                 if (!n.node_) return n;
Chris@16: 
Chris@16:                 std::size_t node_hash = n.node_->hash_;
Chris@16:                 if (key_hash == node_hash)
Chris@16:                 {
Chris@16:                     if (eq(k, this->get_key(*n)))
Chris@16:                         return n;
Chris@16:                 }
Chris@16:                 else
Chris@16:                 {
Chris@16:                     if (this->hash_to_bucket(node_hash) != bucket_index)
Chris@16:                         return iterator();
Chris@16:                 }
Chris@16: 
Chris@16:                 ++n;
Chris@16:             }
Chris@16:         }
Chris@16: 
Chris@16:         std::size_t count(key_type const& k) const
Chris@16:         {
Chris@16:             return this->find_node(k).node_ ? 1 : 0;
Chris@16:         }
Chris@16: 
Chris@16:         value_type& at(key_type const& k) const
Chris@16:         {
Chris@16:             if (this->size_) {
Chris@16:                 iterator it = this->find_node(k);
Chris@16:                 if (it.node_) return *it;
Chris@16:             }
Chris@16: 
Chris@16:             boost::throw_exception(
Chris@16:                 std::out_of_range("Unable to find key in unordered_map."));
Chris@16:         }
Chris@16: 
Chris@16:         std::pair<iterator, iterator>
Chris@16:             equal_range(key_type const& k) const
Chris@16:         {
Chris@16:             iterator n = this->find_node(k);
Chris@16:             iterator n2 = n;
Chris@16:             if (n2.node_) ++n2;
Chris@16:             return std::make_pair(n, n2);
Chris@16:         }
Chris@16: 
Chris@16:         // equals
Chris@16: 
Chris@16:         bool equals(table_impl const& other) const
Chris@16:         {
Chris@16:             if(this->size_ != other.size_) return false;
Chris@16:     
Chris@16:             for(iterator n1 = this->begin(); n1.node_; ++n1)
Chris@16:             {
Chris@16:                 iterator n2 = other.find_matching_node(n1);
Chris@16: 
Chris@16:                 if (!n2.node_ || *n1 != *n2)
Chris@16:                     return false;
Chris@16:             }
Chris@16:     
Chris@16:             return true;
Chris@16:         }
Chris@16: 
Chris@16:         // Emplace/Insert
Chris@16: 
Chris@16:         inline iterator add_node(
Chris@16:                 node_constructor& a,
Chris@16:                 std::size_t key_hash)
Chris@16:         {
Chris@16:             node_pointer n = a.release();
Chris@16:             n->hash_ = key_hash;
Chris@16:     
Chris@16:             bucket_pointer b = this->get_bucket(this->hash_to_bucket(key_hash));
Chris@16: 
Chris@16:             if (!b->next_)
Chris@16:             {
Chris@16:                 link_pointer start_node = this->get_previous_start();
Chris@16:                 
Chris@16:                 if (start_node->next_) {
Chris@16:                     this->get_bucket(this->hash_to_bucket(
Chris@16:                         static_cast<node_pointer>(start_node->next_)->hash_)
Chris@16:                     )->next_ = n;
Chris@16:                 }
Chris@16: 
Chris@16:                 b->next_ = start_node;
Chris@16:                 n->next_ = start_node->next_;
Chris@16:                 start_node->next_ = n;
Chris@16:             }
Chris@16:             else
Chris@16:             {
Chris@16:                 n->next_ = b->next_->next_;
Chris@16:                 b->next_->next_ = n;
Chris@16:             }
Chris@16: 
Chris@16:             ++this->size_;
Chris@16:             return iterator(n);
Chris@16:         }
Chris@16: 
Chris@16:         value_type& operator[](key_type const& k)
Chris@16:         {
Chris@16:             std::size_t key_hash = this->hash(k);
Chris@16:             iterator pos = this->find_node(key_hash, k);
Chris@16:     
Chris@16:             if (pos.node_) return *pos;
Chris@16:     
Chris@16:             // Create the node before rehashing in case it throws an
Chris@16:             // exception (need strong safety in such a case).
Chris@16:             node_constructor a(this->node_alloc());
Chris@16:             a.construct_with_value(BOOST_UNORDERED_EMPLACE_ARGS3(
Chris@16:                 boost::unordered::piecewise_construct,
Chris@16:                 boost::make_tuple(k),
Chris@16:                 boost::make_tuple()));
Chris@16:     
Chris@16:             this->reserve_for_insert(this->size_ + 1);
Chris@16:             return *add_node(a, key_hash);
Chris@16:         }
Chris@16: 
Chris@16: #if defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
Chris@16: #   if defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
Chris@16:         emplace_return emplace(boost::unordered::detail::emplace_args1<
Chris@16:                 boost::unordered::detail::please_ignore_this_overload> const&)
Chris@16:         {
Chris@16:             BOOST_ASSERT(false);
Chris@16:             return emplace_return(this->begin(), false);
Chris@16:         }
Chris@16: #   else
Chris@16:         emplace_return emplace(
Chris@16:                 boost::unordered::detail::please_ignore_this_overload const&)
Chris@16:         {
Chris@16:             BOOST_ASSERT(false);
Chris@16:             return emplace_return(this->begin(), false);
Chris@16:         }
Chris@16: #   endif
Chris@16: #endif
Chris@16: 
Chris@16:         template <BOOST_UNORDERED_EMPLACE_TEMPLATE>
Chris@16:         emplace_return emplace(BOOST_UNORDERED_EMPLACE_ARGS)
Chris@16:         {
Chris@16: #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
Chris@16:             return emplace_impl(
Chris@16:                 extractor::extract(BOOST_UNORDERED_EMPLACE_FORWARD),
Chris@16:                 BOOST_UNORDERED_EMPLACE_FORWARD);
Chris@16: #else
Chris@16:             return emplace_impl(
Chris@16:                 extractor::extract(args.a0, args.a1),
Chris@16:                 BOOST_UNORDERED_EMPLACE_FORWARD);
Chris@16: #endif
Chris@16:         }
Chris@16: 
Chris@16: #if defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
Chris@16:         template <typename A0>
Chris@16:         emplace_return emplace(
Chris@16:                 boost::unordered::detail::emplace_args1<A0> const& args)
Chris@16:         {
Chris@16:             return emplace_impl(extractor::extract(args.a0), args);
Chris@16:         }
Chris@16: #endif
Chris@16: 
Chris@16:         template <BOOST_UNORDERED_EMPLACE_TEMPLATE>
Chris@16:         emplace_return emplace_impl(key_type const& k,
Chris@16:             BOOST_UNORDERED_EMPLACE_ARGS)
Chris@16:         {
Chris@16:             std::size_t key_hash = this->hash(k);
Chris@16:             iterator pos = this->find_node(key_hash, k);
Chris@16:     
Chris@16:             if (pos.node_) return emplace_return(pos, false);
Chris@16:     
Chris@16:             // Create the node before rehashing in case it throws an
Chris@16:             // exception (need strong safety in such a case).
Chris@16:             node_constructor a(this->node_alloc());
Chris@16:             a.construct_with_value(BOOST_UNORDERED_EMPLACE_FORWARD);
Chris@16:     
Chris@16:             // reserve has basic exception safety if the hash function
Chris@16:             // throws, strong otherwise.
Chris@16:             this->reserve_for_insert(this->size_ + 1);
Chris@16:             return emplace_return(this->add_node(a, key_hash), true);
Chris@16:         }
Chris@16: 
Chris@16:         emplace_return emplace_impl_with_node(node_constructor& a)
Chris@16:         {
Chris@16:             key_type const& k = this->get_key(a.value());
Chris@16:             std::size_t key_hash = this->hash(k);
Chris@16:             iterator pos = this->find_node(key_hash, k);
Chris@16: 
Chris@16:             if (pos.node_) return emplace_return(pos, false);
Chris@16: 
Chris@16:             // reserve has basic exception safety if the hash function
Chris@16:             // throws, strong otherwise.
Chris@16:             this->reserve_for_insert(this->size_ + 1);
Chris@16:             return emplace_return(this->add_node(a, key_hash), true);
Chris@16:         }
Chris@16: 
Chris@16:         template <BOOST_UNORDERED_EMPLACE_TEMPLATE>
Chris@16:         emplace_return emplace_impl(no_key, BOOST_UNORDERED_EMPLACE_ARGS)
Chris@16:         {
Chris@16:             // Don't have a key, so construct the node first in order
Chris@16:             // to be able to lookup the position.
Chris@16:             node_constructor a(this->node_alloc());
Chris@16:             a.construct_with_value(BOOST_UNORDERED_EMPLACE_FORWARD);
Chris@16:             return emplace_impl_with_node(a);
Chris@16:         }
Chris@16: 
Chris@16:         ////////////////////////////////////////////////////////////////////////
Chris@16:         // Insert range methods
Chris@16:         //
Chris@16:         // if hash function throws, or inserting > 1 element, basic exception
Chris@16:         // safety strong otherwise
Chris@16: 
Chris@16:         template <class InputIt>
Chris@16:         void insert_range(InputIt i, InputIt j)
Chris@16:         {
Chris@16:             if(i != j)
Chris@16:                 return insert_range_impl(extractor::extract(*i), i, j);
Chris@16:         }
Chris@16: 
Chris@16:         template <class InputIt>
Chris@16:         void insert_range_impl(key_type const& k, InputIt i, InputIt j)
Chris@16:         {
Chris@16:             node_constructor a(this->node_alloc());
Chris@16: 
Chris@16:             insert_range_impl2(a, k, i, j);
Chris@16: 
Chris@16:             while(++i != j) {
Chris@16:                 // Note: can't use get_key as '*i' might not be value_type - it
Chris@16:                 // could be a pair with first_types as key_type without const or
Chris@16:                 // a different second_type.
Chris@16:                 //
Chris@16:                 // TODO: Might be worth storing the value_type instead of the
Chris@16:                 // key here. Could be more efficient if '*i' is expensive. Could
Chris@16:                 // be less efficient if copying the full value_type is
Chris@16:                 // expensive.
Chris@16:                 insert_range_impl2(a, extractor::extract(*i), i, j);
Chris@16:             }
Chris@16:         }
Chris@16: 
Chris@16:         template <class InputIt>
Chris@16:         void insert_range_impl2(node_constructor& a, key_type const& k,
Chris@16:             InputIt i, InputIt j)
Chris@16:         {
Chris@16:             // No side effects in this initial code
Chris@16:             std::size_t key_hash = this->hash(k);
Chris@16:             iterator pos = this->find_node(key_hash, k);
Chris@16:     
Chris@16:             if (!pos.node_) {
Chris@16:                 a.construct_with_value2(*i);
Chris@16:                 if(this->size_ + 1 > this->max_load_)
Chris@16:                     this->reserve_for_insert(this->size_ +
Chris@16:                         boost::unordered::detail::insert_size(i, j));
Chris@16:     
Chris@16:                 // Nothing after this point can throw.
Chris@16:                 this->add_node(a, key_hash);
Chris@16:             }
Chris@16:         }
Chris@16: 
Chris@16:         template <class InputIt>
Chris@16:         void insert_range_impl(no_key, InputIt i, InputIt j)
Chris@16:         {
Chris@16:             node_constructor a(this->node_alloc());
Chris@16: 
Chris@16:             do {
Chris@16:                 a.construct_with_value2(*i);
Chris@16:                 emplace_impl_with_node(a);
Chris@16:             } while(++i != j);
Chris@16:         }
Chris@16: 
Chris@16:         ////////////////////////////////////////////////////////////////////////
Chris@16:         // Erase
Chris@16:         //
Chris@16:         // no throw
Chris@16: 
Chris@16:         std::size_t erase_key(key_type const& k)
Chris@16:         {
Chris@16:             if(!this->size_) return 0;
Chris@16: 
Chris@16:             std::size_t key_hash = this->hash(k);
Chris@16:             std::size_t bucket_index = this->hash_to_bucket(key_hash);
Chris@16:             link_pointer prev = this->get_previous_start(bucket_index);
Chris@16:             if (!prev) return 0;
Chris@16: 
Chris@16:             for (;;)
Chris@16:             {
Chris@16:                 if (!prev->next_) return 0;
Chris@16:                 std::size_t node_hash =
Chris@16:                     static_cast<node_pointer>(prev->next_)->hash_;
Chris@16:                 if (this->hash_to_bucket(node_hash) != bucket_index)
Chris@16:                     return 0;
Chris@16:                 if (node_hash == key_hash &&
Chris@16:                         this->key_eq()(k, this->get_key(
Chris@16:                         static_cast<node_pointer>(prev->next_)->value())))
Chris@16:                     break;
Chris@16:                 prev = prev->next_;
Chris@16:             }
Chris@16: 
Chris@16:             link_pointer end = static_cast<node_pointer>(prev->next_)->next_;
Chris@16: 
Chris@101:             std::size_t deleted_count = this->delete_nodes(prev, end);
Chris@16:             this->fix_bucket(bucket_index, prev);
Chris@101:             return deleted_count;
Chris@16:         }
Chris@16: 
Chris@16:         iterator erase(c_iterator r)
Chris@16:         {
Chris@16:             BOOST_ASSERT(r.node_);
Chris@16:             iterator next(r.node_);
Chris@16:             ++next;
Chris@16:             erase_nodes(r.node_, next.node_);
Chris@16:             return next;
Chris@16:         }
Chris@16: 
Chris@16:         iterator erase_range(c_iterator r1, c_iterator r2)
Chris@16:         {
Chris@16:             if (r1 == r2) return iterator(r2.node_);
Chris@16:             erase_nodes(r1.node_, r2.node_);
Chris@16:             return iterator(r2.node_);
Chris@16:         }
Chris@16: 
Chris@101:         void erase_nodes(node_pointer i, node_pointer j)
Chris@16:         {
Chris@101:             std::size_t bucket_index = this->hash_to_bucket(i->hash_);
Chris@16: 
Chris@101:             // Find the node before i.
Chris@16:             link_pointer prev = this->get_previous_start(bucket_index);
Chris@101:             while(prev->next_ != i) prev = prev->next_;
Chris@16: 
Chris@16:             // Delete the nodes.
Chris@16:             do {
Chris@16:                 this->delete_node(prev);
Chris@16:                 bucket_index = this->fix_bucket(bucket_index, prev);
Chris@101:             } while (prev->next_ != j);
Chris@16:         }
Chris@16: 
Chris@16:         ////////////////////////////////////////////////////////////////////////
Chris@16:         // fill_buckets
Chris@16: 
Chris@16:         template <class NodeCreator>
Chris@16:         static void fill_buckets(iterator n, table& dst,
Chris@16:             NodeCreator& creator)
Chris@16:         {
Chris@16:             link_pointer prev = dst.get_previous_start();
Chris@16: 
Chris@16:             while (n.node_) {
Chris@16:                 node_pointer node = creator.create(*n);
Chris@16:                 node->hash_ = n.node_->hash_;
Chris@16:                 prev->next_ = node;
Chris@16:                 ++dst.size_;
Chris@16:                 ++n;
Chris@16: 
Chris@16:                 prev = place_in_bucket(dst, prev);
Chris@16:             }
Chris@16:         }
Chris@16: 
Chris@16:         // strong otherwise exception safety
Chris@16:         void rehash_impl(std::size_t num_buckets)
Chris@16:         {
Chris@16:             BOOST_ASSERT(this->buckets_);
Chris@16: 
Chris@16:             this->create_buckets(num_buckets);
Chris@16:             link_pointer prev = this->get_previous_start();
Chris@16:             while (prev->next_)
Chris@16:                 prev = place_in_bucket(*this, prev);
Chris@16:         }
Chris@16: 
Chris@16:         // Iterate through the nodes placing them in the correct buckets.
Chris@16:         // pre: prev->next_ is not null.
Chris@16:         static link_pointer place_in_bucket(table& dst, link_pointer prev)
Chris@16:         {
Chris@16:             node_pointer n = static_cast<node_pointer>(prev->next_);
Chris@16:             bucket_pointer b = dst.get_bucket(dst.hash_to_bucket(n->hash_));
Chris@16: 
Chris@16:             if (!b->next_) {
Chris@16:                 b->next_ = prev;
Chris@16:                 return n;
Chris@16:             }
Chris@16:             else {
Chris@16:                 prev->next_ = n->next_;
Chris@16:                 n->next_ = b->next_->next_;
Chris@16:                 b->next_->next_ = n;
Chris@16:                 return prev;
Chris@16:             }
Chris@16:         }
Chris@16:     };
Chris@16: }}}
Chris@16: 
Chris@16: #endif