1 /* Copyright 2003-2007 Joaquín M López Muñoz.
2 * Distributed under the Boost Software License, Version 1.0.
3 * (See accompanying file LICENSE_1_0.txt or copy at
4 * http://www.boost.org/LICENSE_1_0.txt)
6 * See http://www.boost.org/libs/multi_index for library home page.
9 #ifndef BOOST_MULTI_INDEX_DETAIL_COPY_MAP_HPP
10 #define BOOST_MULTI_INDEX_DETAIL_COPY_MAP_HPP
12 #if defined(_MSC_VER)&&(_MSC_VER>=1200)
16 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
18 #include <boost/detail/no_exceptions_support.hpp>
19 #include <boost/multi_index/detail/auto_space.hpp>
20 #include <boost/multi_index/detail/prevent_eti.hpp>
21 #include <boost/noncopyable.hpp>
27 namespace multi_index{
31 /* copy_map is used as an auxiliary structure during copy_() operations.
32 * When a container with n nodes is replicated, node_map holds the pairings
33 * between original and copied nodes, and provides a fast way to find a
34 * copied node from an original one.
35 * The semantics of the class are not simple, and no attempt has been made
36 * to enforce it: multi_index_container handles it right. On the other hand,
37 * the const interface, which is the one provided to index implementations,
39 * - Enumeration of pairs of (original,copied) nodes (excluding the headers),
40 * - fast retrieval of copied nodes (including the headers.)
43 template <typename Node>
46 copy_map_entry(Node* f,Node* s):first(f),second(s){}
51 bool operator<(const copy_map_entry<Node>& x)const
53 return std::less<Node*>()(first,x.first);
57 template <typename Node,typename Allocator>
58 class copy_map:private noncopyable
61 typedef const copy_map_entry<Node>* const_iterator;
64 const Allocator& al,std::size_t size,Node* header_org,Node* header_cpy):
65 al_(al),size_(size),spc(al_,size_),n(0),
66 header_org_(header_org),header_cpy_(header_cpy),released(false)
72 for(std::size_t i=0;i<n;++i){
73 boost::detail::allocator::destroy(&(spc.data()+i)->second->value());
74 deallocate((spc.data()+i)->second);
79 const_iterator begin()const{return &*spc.data();}
80 const_iterator end()const{return &*(spc.data()+n);}
82 void clone(Node* node)
84 (spc.data()+n)->first=node;
85 (spc.data()+n)->second=&*al_.allocate(1);
87 boost::detail::allocator::construct(
88 &(spc.data()+n)->second->value(),node->value());
91 deallocate((spc.data()+n)->second);
97 if(n==size_)std::sort(&*spc.data(),&*spc.data()+size_);
100 Node* find(Node* node)const
102 if(node==header_org_)return header_cpy_;
103 return std::lower_bound(
104 begin(),end(),copy_map_entry<Node>(node,0))->second;
113 typedef typename prevent_eti<
115 typename boost::detail::allocator::rebind_to<
116 Allocator,Node>::type
117 >::type allocator_type;
118 typedef typename allocator_type::pointer allocator_pointer;
122 auto_space<copy_map_entry<Node>,Allocator> spc;
128 void deallocate(Node* node)
130 al_.deallocate(static_cast<allocator_pointer>(node),1);
134 } /* namespace multi_index::detail */
136 } /* namespace multi_index */
138 } /* namespace boost */