/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_HASH_INDEX_NODE_HPP #define BOOST_MULTI_INDEX_DETAIL_HASH_INDEX_NODE_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include namespace boost{ namespace multi_index{ namespace detail{ /* singly-linked node for use by hashed_index */ template struct hashed_index_node_impl { typedef typename prevent_eti< Allocator, typename boost::detail::allocator::rebind_to< Allocator,hashed_index_node_impl >::type >::type::pointer pointer; typedef typename prevent_eti< Allocator, typename boost::detail::allocator::rebind_to< Allocator,hashed_index_node_impl >::type >::type::const_pointer const_pointer; pointer& next(){return next_;} pointer next()const{return next_;} pointer& prev(){return prev_;} pointer prev()const{return prev_;} /* algorithmic stuff */ static void increment(pointer& x,pointer bbegin,pointer bend) { std::less_equal leq; x=x->next(); if(leq(bbegin,x)&&leq(x,bend)){ /* bucket node */ do{ ++x; }while(x->next()==x); x=x->next(); } } static void link(pointer x,pointer pos) { x->next()=pos->next(); pos->next()->prev() = x; pos->next()=x; x->prev() = pos; }; static void unlink(pointer x) {/* pointer y=x->next(); while(y->next()!=x){y=y->next();} y->next()=x->next(); */ x->next()->prev() = x->prev(); x->prev()->next() = x->next(); } static pointer prev(pointer x) {/* pointer y=x->next(); while(y->next()!=x){y=y->next();} return y; */ return x->prev(); } static void unlink_next(pointer x) { /* x->next()=x->next()->next(); */ x->next()->next()->prev() = x; x->next() = x->next()->next(); } private: pointer next_; pointer prev_; }; template struct hashed_index_node_trampoline: prevent_eti< Super, hashed_index_node_impl< typename boost::detail::allocator::rebind_to< typename Super::allocator_type, char >::type > >::type { typedef typename prevent_eti< Super, hashed_index_node_impl< typename boost::detail::allocator::rebind_to< typename Super::allocator_type, char >::type > >::type impl_type; }; template struct hashed_index_node:Super,hashed_index_node_trampoline { private: typedef hashed_index_node_trampoline trampoline; public: typedef typename trampoline::impl_type impl_type; typedef typename trampoline::pointer impl_pointer; typedef typename trampoline::const_pointer const_impl_pointer; impl_pointer impl() { return static_cast( static_cast(static_cast(this))); } const_impl_pointer impl()const { return static_cast( static_cast(static_cast(this))); } static hashed_index_node* from_impl(impl_pointer x) { return static_cast( static_cast(&*x)); } static const hashed_index_node* from_impl(const_impl_pointer x) { return static_cast( static_cast(&*x)); } static void increment( hashed_index_node*& x,impl_pointer bbegin,impl_pointer bend) { impl_pointer xi=x->impl(); trampoline::increment(xi,bbegin,bend); x=from_impl(xi); } }; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif