Chris@101: /* Copyright 2003-2013 Joaquin M Lopez Munoz.
Chris@16:  * Distributed under the Boost Software License, Version 1.0.
Chris@16:  * (See accompanying file LICENSE_1_0.txt or copy at
Chris@16:  * http://www.boost.org/LICENSE_1_0.txt)
Chris@16:  *
Chris@16:  * See http://www.boost.org/libs/multi_index for library home page.
Chris@16:  */
Chris@16: 
Chris@16: #ifndef BOOST_MULTI_INDEX_DETAIL_INDEX_LOADER_HPP
Chris@16: #define BOOST_MULTI_INDEX_DETAIL_INDEX_LOADER_HPP
Chris@16: 
Chris@101: #if defined(_MSC_VER)
Chris@16: #pragma once
Chris@16: #endif
Chris@16: 
Chris@16: #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
Chris@16: #include <algorithm>
Chris@16: #include <boost/archive/archive_exception.hpp>
Chris@16: #include <boost/noncopyable.hpp>
Chris@16: #include <boost/multi_index/detail/auto_space.hpp>
Chris@16: #include <boost/serialization/nvp.hpp>
Chris@16: #include <boost/throw_exception.hpp> 
Chris@16: #include <cstddef>
Chris@16: 
Chris@16: namespace boost{
Chris@16: 
Chris@16: namespace multi_index{
Chris@16: 
Chris@16: namespace detail{
Chris@16: 
Chris@16: /* Counterpart of index_saver (check index_saver.hpp for serialization
Chris@16:  * details.)* multi_index_container is in charge of supplying the info about
Chris@16:  * the base sequence, and each index can subsequently load itself using the
Chris@16:  * const interface of index_loader.
Chris@16:  */
Chris@16: 
Chris@16: template<typename Node,typename FinalNode,typename Allocator>
Chris@16: class index_loader:private noncopyable
Chris@16: {
Chris@16: public:
Chris@16:   index_loader(const Allocator& al,std::size_t size):
Chris@16:     spc(al,size),size_(size),n(0),sorted(false)
Chris@16:   {
Chris@16:   }
Chris@16: 
Chris@16:   template<class Archive>
Chris@16:   void add(Node* node,Archive& ar,const unsigned int)
Chris@16:   {
Chris@16:     ar>>serialization::make_nvp("position",*node);
Chris@16:     entries()[n++]=node;
Chris@16:   }
Chris@16: 
Chris@16:   template<class Archive>
Chris@16:   void add_track(Node* node,Archive& ar,const unsigned int)
Chris@16:   {
Chris@16:     ar>>serialization::make_nvp("position",*node);
Chris@16:   }
Chris@16: 
Chris@16:   /* A rearranger is passed two nodes, and is expected to
Chris@16:    * reposition the second after the first.
Chris@16:    * If the first node is 0, then the second should be moved
Chris@16:    * to the beginning of the sequence.
Chris@16:    */
Chris@16: 
Chris@16:   template<typename Rearranger,class Archive>
Chris@16:   void load(Rearranger r,Archive& ar,const unsigned int)const
Chris@16:   {
Chris@16:     FinalNode* prev=unchecked_load_node(ar);
Chris@16:     if(!prev)return;
Chris@16: 
Chris@16:     if(!sorted){
Chris@16:       std::sort(entries(),entries()+size_);
Chris@16:       sorted=true;
Chris@16:     }
Chris@16: 
Chris@16:     check_node(prev);
Chris@16: 
Chris@16:     for(;;){
Chris@16:       for(;;){
Chris@16:         FinalNode* node=load_node(ar);
Chris@16:         if(!node)break;
Chris@16: 
Chris@16:         if(node==prev)prev=0;
Chris@16:         r(prev,node);
Chris@16: 
Chris@16:         prev=node;
Chris@16:       }
Chris@16:       prev=load_node(ar);
Chris@16:       if(!prev)break;
Chris@16:     }
Chris@16:   }
Chris@16: 
Chris@16: private:
Chris@16:   Node** entries()const{return &*spc.data();}
Chris@16: 
Chris@16:   /* We try to delay sorting as much as possible just in case it
Chris@16:    * is not necessary, hence this version of load_node.
Chris@16:    */
Chris@16: 
Chris@16:   template<class Archive>
Chris@16:   FinalNode* unchecked_load_node(Archive& ar)const
Chris@16:   {
Chris@16:     Node* node=0;
Chris@16:     ar>>serialization::make_nvp("pointer",node);
Chris@16:     return static_cast<FinalNode*>(node);
Chris@16:   }
Chris@16: 
Chris@16:   template<class Archive>
Chris@16:   FinalNode* load_node(Archive& ar)const
Chris@16:   {
Chris@16:     Node* node=0;
Chris@16:     ar>>serialization::make_nvp("pointer",node);
Chris@16:     check_node(node);
Chris@16:     return static_cast<FinalNode*>(node);
Chris@16:   }
Chris@16: 
Chris@16:   void check_node(Node* node)const
Chris@16:   {
Chris@16:     if(node!=0&&!std::binary_search(entries(),entries()+size_,node)){
Chris@16:       throw_exception(
Chris@16:         archive::archive_exception(
Chris@16:           archive::archive_exception::other_exception));
Chris@16:     }
Chris@16:   }
Chris@16: 
Chris@16:   auto_space<Node*,Allocator> spc;
Chris@16:   std::size_t                 size_;
Chris@16:   std::size_t                 n;
Chris@16:   mutable bool                sorted;
Chris@16: };
Chris@16: 
Chris@16: } /* namespace multi_index::detail */
Chris@16: 
Chris@16: } /* namespace multi_index */
Chris@16: 
Chris@16: } /* namespace boost */
Chris@16: 
Chris@16: #endif