/* 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_SEQUENCED_INDEX_HPP | |
#define BOOST_MULTI_INDEX_SEQUENCED_INDEX_HPP | |
#if defined(_MSC_VER)&&(_MSC_VER>=1200) | |
#pragma once | |
#endif | |
#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */ | |
#include <boost/call_traits.hpp> | |
#include <boost/detail/allocator_utilities.hpp> | |
#include <boost/detail/no_exceptions_support.hpp> | |
#include <boost/detail/workaround.hpp> | |
#include <boost/iterator/reverse_iterator.hpp> | |
#include <boost/mpl/bool.hpp> | |
#include <boost/mpl/not.hpp> | |
#include <boost/mpl/push_front.hpp> | |
#include <boost/multi_index/detail/access_specifier.hpp> | |
#include <boost/multi_index/detail/bidir_node_iterator.hpp> | |
#include <boost/multi_index/detail/index_node_base.hpp> | |
#include <boost/multi_index/detail/safe_ctr_proxy.hpp> | |
#include <boost/multi_index/detail/safe_mode.hpp> | |
#include <boost/multi_index/detail/scope_guard.hpp> | |
#include <boost/multi_index/detail/seq_index_node.hpp> | |
#include <boost/multi_index/detail/seq_index_ops.hpp> | |
#include <boost/multi_index/sequenced_index_fwd.hpp> | |
#include <boost/tuple/tuple.hpp> | |
#include <boost/type_traits/is_integral.hpp> | |
#include <cstddef> | |
#include <functional> | |
#include <utility> | |
#if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) | |
#include <boost/bind.hpp> | |
#endif | |
#if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING) | |
#define BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT \ | |
detail::scope_guard BOOST_JOIN(check_invariant_,__LINE__)= \ | |
detail::make_obj_guard(*this,&sequenced_index::check_invariant_); \ | |
BOOST_JOIN(check_invariant_,__LINE__).touch(); | |
#else | |
#define BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT | |
#endif | |
namespace boost{ | |
namespace multi_index{ | |
namespace detail{ | |
/* sequenced_index adds a layer of sequenced indexing to a given Super */ | |
template<typename SuperMeta,typename TagList> | |
class sequenced_index: | |
BOOST_MULTI_INDEX_PROTECTED_IF_MEMBER_TEMPLATE_FRIENDS SuperMeta::type | |
#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) | |
#if BOOST_WORKAROUND(BOOST_MSVC,<1300) | |
,public safe_ctr_proxy_impl< | |
bidir_node_iterator< | |
sequenced_index_node<typename SuperMeta::type::node_type> >, | |
sequenced_index<SuperMeta,TagList> > | |
#else | |
,public safe_mode::safe_container< | |
sequenced_index<SuperMeta,TagList> > | |
#endif | |
#endif | |
{ | |
#if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING)&&\ | |
BOOST_WORKAROUND(__MWERKS__,<=0x3003) | |
/* The "ISO C++ Template Parser" option in CW8.3 has a problem with the | |
* lifetime of const references bound to temporaries --precisely what | |
* scopeguards are. | |
*/ | |
#pragma parse_mfunc_templ off | |
#endif | |
typedef typename SuperMeta::type super; | |
protected: | |
typedef sequenced_index_node< | |
typename super::node_type> node_type; | |
private: | |
typedef typename node_type::impl_type node_impl_type; | |
public: | |
/* types */ | |
typedef typename node_type::value_type value_type; | |
typedef tuples::null_type ctor_args; | |
typedef typename super::final_allocator_type allocator_type; | |
typedef typename allocator_type::reference reference; | |
typedef typename allocator_type::const_reference const_reference; | |
#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) | |
#if BOOST_WORKAROUND(BOOST_MSVC,<1300) | |
typedef safe_mode::safe_iterator< | |
bidir_node_iterator<node_type>, | |
safe_ctr_proxy< | |
bidir_node_iterator<node_type> > > iterator; | |
#else | |
typedef safe_mode::safe_iterator< | |
bidir_node_iterator<node_type>, | |
sequenced_index> iterator; | |
#endif | |
#else | |
typedef bidir_node_iterator<node_type> iterator; | |
#endif | |
typedef iterator const_iterator; | |
typedef std::size_t size_type; | |
typedef std::ptrdiff_t difference_type; | |
typedef typename allocator_type::pointer pointer; | |
typedef typename allocator_type::const_pointer const_pointer; | |
typedef typename | |
boost::reverse_iterator<iterator> reverse_iterator; | |
typedef typename | |
boost::reverse_iterator<const_iterator> const_reverse_iterator; | |
typedef TagList tag_list; | |
protected: | |
typedef typename super::final_node_type final_node_type; | |
typedef tuples::cons< | |
ctor_args, | |
typename super::ctor_args_list> ctor_args_list; | |
typedef typename mpl::push_front< | |
typename super::index_type_list, | |
sequenced_index>::type index_type_list; | |
typedef typename mpl::push_front< | |
typename super::iterator_type_list, | |
iterator>::type iterator_type_list; | |
typedef typename mpl::push_front< | |
typename super::const_iterator_type_list, | |
const_iterator>::type const_iterator_type_list; | |
typedef typename super::copy_map_type copy_map_type; | |
#if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) | |
typedef typename super::index_saver_type index_saver_type; | |
typedef typename super::index_loader_type index_loader_type; | |
#endif | |
private: | |
#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) | |
#if BOOST_WORKAROUND(BOOST_MSVC,<1300) | |
typedef safe_ctr_proxy_impl< | |
bidir_node_iterator<node_type>, | |
sequenced_index> safe_super; | |
#else | |
typedef safe_mode::safe_container< | |
sequenced_index> safe_super; | |
#endif | |
#endif | |
typedef typename call_traits<value_type>::param_type value_param_type; | |
public: | |
/* construct/copy/destroy | |
* Default and copy ctors are in the protected section as indices are | |
* not supposed to be created on their own. No range ctor either. | |
*/ | |
sequenced_index<SuperMeta,TagList>& operator=( | |
const sequenced_index<SuperMeta,TagList>& x) | |
{ | |
this->final()=x.final(); | |
return *this; | |
} | |
template <class InputIterator> | |
void assign(InputIterator first,InputIterator last) | |
{ | |
assign_iter(first,last,mpl::not_<is_integral<InputIterator> >()); | |
} | |
void assign(size_type n,value_param_type value) | |
{ | |
BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; | |
clear(); | |
for(size_type i=0;i<n;++i)push_back(value); | |
} | |
allocator_type get_allocator()const | |
{ | |
return this->final().get_allocator(); | |
} | |
/* iterators */ | |
iterator begin() | |
{return make_iterator(node_type::from_impl(header()->next()));} | |
const_iterator begin()const | |
{return make_iterator(node_type::from_impl(header()->next()));} | |
iterator end(){return make_iterator(header());} | |
const_iterator end()const{return make_iterator(header());} | |
reverse_iterator rbegin(){return make_reverse_iterator(end());} | |
const_reverse_iterator rbegin()const{return make_reverse_iterator(end());} | |
reverse_iterator rend(){return make_reverse_iterator(begin());} | |
const_reverse_iterator rend()const{return make_reverse_iterator(begin());} | |
const_iterator cbegin()const{return begin();} | |
const_iterator cend()const{return end();} | |
const_reverse_iterator crbegin()const{return rbegin();} | |
const_reverse_iterator crend()const{return rend();} | |
iterator iterator_to(const value_type& x) | |
{ | |
return make_iterator(node_from_value<node_type>(&x)); | |
} | |
const_iterator iterator_to(const value_type& x)const | |
{ | |
return make_iterator(node_from_value<node_type>(&x)); | |
} | |
/* capacity */ | |
bool empty()const{return this->final_empty_();} | |
size_type size()const{return this->final_size_();} | |
size_type max_size()const{return this->final_max_size_();} | |
void resize(size_type n,value_param_type x=value_type()) | |
{ | |
BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; | |
if(n>size())insert(end(),n-size(),x); | |
else if(n<size()){ | |
iterator it; | |
if(n<=size()/2){ | |
it=begin(); | |
std::advance(it,n); | |
} | |
else{ | |
it=end(); | |
for(size_type m=size()-n;m--;--it){} | |
} | |
erase(it,end()); | |
} | |
} | |
/* access: no non-const versions provided as sequenced_index | |
* handles const elements. | |
*/ | |
const_reference front()const{return *begin();} | |
const_reference back()const{return *--end();} | |
/* modifiers */ | |
std::pair<iterator,bool> push_front(value_param_type x) | |
{return insert(begin(),x);} | |
void pop_front(){erase(begin());} | |
std::pair<iterator,bool> push_back(value_param_type x) | |
{return insert(end(),x);} | |
void pop_back(){erase(--end());} | |
std::pair<iterator,bool> insert(iterator position,value_param_type x) | |
{ | |
BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); | |
BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); | |
BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; | |
std::pair<final_node_type*,bool> p=this->final_insert_(x); | |
if(p.second&&position.get_node()!=header()){ | |
relink(position.get_node(),p.first); | |
} | |
return std::pair<iterator,bool>(make_iterator(p.first),p.second); | |
} | |
void insert(iterator position,size_type n,value_param_type x) | |
{ | |
BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); | |
BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); | |
BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; | |
for(size_type i=0;i<n;++i)insert(position,x); | |
} | |
template<typename InputIterator> | |
void insert(iterator position,InputIterator first,InputIterator last) | |
{ | |
insert_iter(position,first,last,mpl::not_<is_integral<InputIterator> >()); | |
} | |
iterator erase(iterator position) | |
{ | |
BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); | |
BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); | |
BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); | |
BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; | |
this->final_erase_(static_cast<final_node_type*>(position++.get_node())); | |
return position; | |
} | |
iterator erase(iterator first,iterator last) | |
{ | |
BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(first); | |
BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(last); | |
BOOST_MULTI_INDEX_CHECK_IS_OWNER(first,*this); | |
BOOST_MULTI_INDEX_CHECK_IS_OWNER(last,*this); | |
BOOST_MULTI_INDEX_CHECK_VALID_RANGE(first,last); | |
BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; | |
while(first!=last){ | |
first=erase(first); | |
} | |
return first; | |
} | |
bool replace(iterator position,value_param_type x) | |
{ | |
BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); | |
BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); | |
BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); | |
BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; | |
return this->final_replace_( | |
x,static_cast<final_node_type*>(position.get_node())); | |
} | |
template<typename Modifier> | |
bool modify(iterator position,Modifier mod) | |
{ | |
BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); | |
BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); | |
BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); | |
BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; | |
#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) | |
/* MSVC++ 6.0 optimizer on safe mode code chokes if this | |
* this is not added. Left it for all compilers as it does no | |
* harm. | |
*/ | |
position.detach(); | |
#endif | |
return this->final_modify_( | |
mod,static_cast<final_node_type*>(position.get_node())); | |
} | |
template<typename Modifier,typename Rollback> | |
bool modify(iterator position,Modifier mod,Rollback back) | |
{ | |
BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); | |
BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); | |
BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); | |
BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; | |
#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) | |
/* MSVC++ 6.0 optimizer on safe mode code chokes if this | |
* this is not added. Left it for all compilers as it does no | |
* harm. | |
*/ | |
position.detach(); | |
#endif | |
return this->final_modify_( | |
mod,back,static_cast<final_node_type*>(position.get_node())); | |
} | |
void swap(sequenced_index<SuperMeta,TagList>& x) | |
{ | |
BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; | |
this->final_swap_(x.final()); | |
} | |
void clear() | |
{ | |
BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; | |
this->final_clear_(); | |
} | |
/* list operations */ | |
void splice(iterator position,sequenced_index<SuperMeta,TagList>& x) | |
{ | |
BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); | |
BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); | |
BOOST_MULTI_INDEX_CHECK_DIFFERENT_CONTAINER(*this,x); | |
BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; | |
iterator first=x.begin(),last=x.end(); | |
while(first!=last){ | |
if(insert(position,*first).second)first=x.erase(first); | |
else ++first; | |
} | |
} | |
void splice(iterator position,sequenced_index<SuperMeta,TagList>& x,iterator i) | |
{ | |
BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); | |
BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); | |
BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(i); | |
BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(i); | |
BOOST_MULTI_INDEX_CHECK_IS_OWNER(i,x); | |
BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; | |
if(&x==this){ | |
if(position!=i)relink(position.get_node(),i.get_node()); | |
} | |
else{ | |
if(insert(position,*i).second){ | |
#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) | |
/* MSVC++ 6.0 optimizer has a hard time with safe mode, and the following | |
* workaround is needed. Left it for all compilers as it does no | |
* harm. | |
*/ | |
i.detach(); | |
x.erase(x.make_iterator(i.get_node())); | |
#else | |
x.erase(i); | |
#endif | |
} | |
} | |
} | |
void splice( | |
iterator position,sequenced_index<SuperMeta,TagList>& x, | |
iterator first,iterator last) | |
{ | |
BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); | |
BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); | |
BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(first); | |
BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(last); | |
BOOST_MULTI_INDEX_CHECK_IS_OWNER(first,x); | |
BOOST_MULTI_INDEX_CHECK_IS_OWNER(last,x); | |
BOOST_MULTI_INDEX_CHECK_VALID_RANGE(first,last); | |
BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; | |
if(&x==this){ | |
BOOST_MULTI_INDEX_CHECK_OUTSIDE_RANGE(position,first,last); | |
if(position!=last)relink( | |
position.get_node(),first.get_node(),last.get_node()); | |
} | |
else{ | |
while(first!=last){ | |
if(insert(position,*first).second)first=x.erase(first); | |
else ++first; | |
} | |
} | |
} | |
void remove(value_param_type value) | |
{ | |
sequenced_index_remove( | |
*this,std::bind2nd(std::equal_to<value_type>(),value)); | |
} | |
template<typename Predicate> | |
void remove_if(Predicate pred) | |
{ | |
sequenced_index_remove(*this,pred); | |
} | |
void unique() | |
{ | |
sequenced_index_unique(*this,std::equal_to<value_type>()); | |
} | |
template <class BinaryPredicate> | |
void unique(BinaryPredicate binary_pred) | |
{ | |
sequenced_index_unique(*this,binary_pred); | |
} | |
void merge(sequenced_index<SuperMeta,TagList>& x) | |
{ | |
sequenced_index_merge(*this,x,std::less<value_type>()); | |
} | |
template <typename Compare> | |
void merge(sequenced_index<SuperMeta,TagList>& x,Compare comp) | |
{ | |
sequenced_index_merge(*this,x,comp); | |
} | |
void sort() | |
{ | |
BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; | |
sequenced_index_sort(header(),std::less<value_type>()); | |
} | |
template <typename Compare> | |
void sort(Compare comp) | |
{ | |
BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; | |
sequenced_index_sort(header(),comp); | |
} | |
void reverse() | |
{ | |
BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; | |
node_impl_type::reverse(header()->impl()); | |
} | |
/* rearrange operations */ | |
void relocate(iterator position,iterator i) | |
{ | |
BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); | |
BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); | |
BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(i); | |
BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(i); | |
BOOST_MULTI_INDEX_CHECK_IS_OWNER(i,*this); | |
BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; | |
if(position!=i)relink(position.get_node(),i.get_node()); | |
} | |
void relocate(iterator position,iterator first,iterator last) | |
{ | |
BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); | |
BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); | |
BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(first); | |
BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(last); | |
BOOST_MULTI_INDEX_CHECK_IS_OWNER(first,*this); | |
BOOST_MULTI_INDEX_CHECK_IS_OWNER(last,*this); | |
BOOST_MULTI_INDEX_CHECK_VALID_RANGE(first,last); | |
BOOST_MULTI_INDEX_CHECK_OUTSIDE_RANGE(position,first,last); | |
BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; | |
if(position!=last)relink( | |
position.get_node(),first.get_node(),last.get_node()); | |
} | |
template<typename InputIterator> | |
void rearrange(InputIterator first) | |
{ | |
BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; | |
node_type* pos=header(); | |
for(size_type s=size();s--;){ | |
const value_type& v=*first++; | |
relink(pos,node_from_value<node_type>(&v)); | |
} | |
} | |
BOOST_MULTI_INDEX_PROTECTED_IF_MEMBER_TEMPLATE_FRIENDS: | |
sequenced_index(const ctor_args_list& args_list,const allocator_type& al): | |
super(args_list.get_tail(),al) | |
{ | |
empty_initialize(); | |
} | |
sequenced_index(const sequenced_index<SuperMeta,TagList>& x): | |
super(x) | |
#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) | |
,safe_super() | |
#endif | |
{ | |
/* The actual copying takes place in subsequent call to copy_(). | |
*/ | |
} | |
~sequenced_index() | |
{ | |
/* the container is guaranteed to be empty by now */ | |
} | |
#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) | |
iterator make_iterator(node_type* node){return iterator(node,this);} | |
const_iterator make_iterator(node_type* node)const | |
{return const_iterator(node,const_cast<sequenced_index*>(this));} | |
#else | |
iterator make_iterator(node_type* node){return iterator(node);} | |
const_iterator make_iterator(node_type* node)const | |
{return const_iterator(node);} | |
#endif | |
void copy_( | |
const sequenced_index<SuperMeta,TagList>& x,const copy_map_type& map) | |
{ | |
node_type* org=x.header(); | |
node_type* cpy=header(); | |
do{ | |
node_type* next_org=node_type::from_impl(org->next()); | |
node_type* next_cpy=map.find(static_cast<final_node_type*>(next_org)); | |
cpy->next()=next_cpy->impl(); | |
next_cpy->prior()=cpy->impl(); | |
org=next_org; | |
cpy=next_cpy; | |
}while(org!=x.header()); | |
super::copy_(x,map); | |
} | |
node_type* insert_(value_param_type v,node_type* x) | |
{ | |
node_type* res=static_cast<node_type*>(super::insert_(v,x)); | |
if(res==x)link(x); | |
return res; | |
} | |
node_type* insert_(value_param_type v,node_type* position,node_type* x) | |
{ | |
node_type* res=static_cast<node_type*>(super::insert_(v,position,x)); | |
if(res==x)link(x); | |
return res; | |
} | |
void erase_(node_type* x) | |
{ | |
unlink(x); | |
super::erase_(x); | |
#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) | |
detach_iterators(x); | |
#endif | |
} | |
void delete_all_nodes_() | |
{ | |
for(node_type* x=node_type::from_impl(header()->next());x!=header();){ | |
node_type* y=node_type::from_impl(x->next()); | |
this->final_delete_node_(static_cast<final_node_type*>(x)); | |
x=y; | |
} | |
} | |
void clear_() | |
{ | |
super::clear_(); | |
empty_initialize(); | |
#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) | |
safe_super::detach_dereferenceable_iterators(); | |
#endif | |
} | |
void swap_(sequenced_index<SuperMeta,TagList>& x) | |
{ | |
#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) | |
safe_super::swap(x); | |
#endif | |
super::swap_(x); | |
} | |
bool replace_(value_param_type v,node_type* x) | |
{ | |
return super::replace_(v,x); | |
} | |
bool modify_(node_type* x) | |
{ | |
BOOST_TRY{ | |
if(!super::modify_(x)){ | |
unlink(x); | |
#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) | |
detach_iterators(x); | |
#endif | |
return false; | |
} | |
else return true; | |
} | |
BOOST_CATCH(...){ | |
unlink(x); | |
#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) | |
detach_iterators(x); | |
#endif | |
BOOST_RETHROW; | |
} | |
BOOST_CATCH_END | |
} | |
bool modify_rollback_(node_type* x) | |
{ | |
return super::modify_rollback_(x); | |
} | |
#if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) | |
/* serialization */ | |
template<typename Archive> | |
void save_( | |
Archive& ar,const unsigned int version,const index_saver_type& sm)const | |
{ | |
sm.save(begin(),end(),ar,version); | |
super::save_(ar,version,sm); | |
} | |
template<typename Archive> | |
void load_( | |
Archive& ar,const unsigned int version,const index_loader_type& lm) | |
{ | |
lm.load( | |
::boost::bind(&sequenced_index::rearranger,this,_1,_2), | |
ar,version); | |
super::load_(ar,version,lm); | |
} | |
#endif | |
#if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING) | |
/* invariant stuff */ | |
bool invariant_()const | |
{ | |
if(size()==0||begin()==end()){ | |
if(size()!=0||begin()!=end()|| | |
header()->next()!=header()->impl()|| | |
header()->prior()!=header()->impl())return false; | |
} | |
else{ | |
size_type s=0; | |
for(const_iterator it=begin(),it_end=end();it!=it_end;++it,++s){ | |
if(it.get_node()->next()->prior()!=it.get_node()->impl())return false; | |
if(it.get_node()->prior()->next()!=it.get_node()->impl())return false; | |
} | |
if(s!=size())return false; | |
} | |
return super::invariant_(); | |
} | |
/* This forwarding function eases things for the boost::mem_fn construct | |
* in BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT. Actually, | |
* final_check_invariant is already an inherited member function of index. | |
*/ | |
void check_invariant_()const{this->final_check_invariant_();} | |
#endif | |
private: | |
node_type* header()const{return this->final_header();} | |
void empty_initialize() | |
{ | |
header()->prior()=header()->next()=header()->impl(); | |
} | |
void link(node_type* x) | |
{ | |
node_impl_type::link(x->impl(),header()->impl()); | |
}; | |
static void unlink(node_type* x) | |
{ | |
node_impl_type::unlink(x->impl()); | |
} | |
static void relink(node_type* position,node_type* x) | |
{ | |
node_impl_type::relink(position->impl(),x->impl()); | |
} | |
static void relink(node_type* position,node_type* first,node_type* last) | |
{ | |
node_impl_type::relink( | |
position->impl(),first->impl(),last->impl()); | |
} | |
#if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) | |
void rearranger(node_type* position,node_type *x) | |
{ | |
if(!position)position=header(); | |
node_type::increment(position); | |
if(position!=x)relink(position,x); | |
} | |
#endif | |
#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) | |
void detach_iterators(node_type* x) | |
{ | |
iterator it=make_iterator(x); | |
safe_mode::detach_equivalent_iterators(it); | |
} | |
#endif | |
template <class InputIterator> | |
void assign_iter(InputIterator first,InputIterator last,mpl::true_) | |
{ | |
BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; | |
clear(); | |
for(;first!=last;++first)push_back(*first); | |
} | |
void assign_iter(size_type n,value_param_type value,mpl::false_) | |
{ | |
BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; | |
clear(); | |
for(size_type i=0;i<n;++i)push_back(value); | |
} | |
template<typename InputIterator> | |
void insert_iter( | |
iterator position,InputIterator first,InputIterator last,mpl::true_) | |
{ | |
BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; | |
for(;first!=last;++first)insert(position,*first); | |
} | |
void insert_iter( | |
iterator position,size_type n,value_param_type x,mpl::false_) | |
{ | |
BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); | |
BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); | |
BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; | |
for(size_type i=0;i<n;++i)insert(position,x); | |
} | |
#if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING)&&\ | |
BOOST_WORKAROUND(__MWERKS__,<=0x3003) | |
#pragma parse_mfunc_templ reset | |
#endif | |
}; | |
/* comparison */ | |
template< | |
typename SuperMeta1,typename TagList1, | |
typename SuperMeta2,typename TagList2 | |
> | |
bool operator==( | |
const sequenced_index<SuperMeta1,TagList1>& x, | |
const sequenced_index<SuperMeta2,TagList2>& y) | |
{ | |
return x.size()==y.size()&&std::equal(x.begin(),x.end(),y.begin()); | |
} | |
template< | |
typename SuperMeta1,typename TagList1, | |
typename SuperMeta2,typename TagList2 | |
> | |
bool operator<( | |
const sequenced_index<SuperMeta1,TagList1>& x, | |
const sequenced_index<SuperMeta2,TagList2>& y) | |
{ | |
return std::lexicographical_compare(x.begin(),x.end(),y.begin(),y.end()); | |
} | |
template< | |
typename SuperMeta1,typename TagList1, | |
typename SuperMeta2,typename TagList2 | |
> | |
bool operator!=( | |
const sequenced_index<SuperMeta1,TagList1>& x, | |
const sequenced_index<SuperMeta2,TagList2>& y) | |
{ | |
return !(x==y); | |
} | |
template< | |
typename SuperMeta1,typename TagList1, | |
typename SuperMeta2,typename TagList2 | |
> | |
bool operator>( | |
const sequenced_index<SuperMeta1,TagList1>& x, | |
const sequenced_index<SuperMeta2,TagList2>& y) | |
{ | |
return y<x; | |
} | |
template< | |
typename SuperMeta1,typename TagList1, | |
typename SuperMeta2,typename TagList2 | |
> | |
bool operator>=( | |
const sequenced_index<SuperMeta1,TagList1>& x, | |
const sequenced_index<SuperMeta2,TagList2>& y) | |
{ | |
return !(x<y); | |
} | |
template< | |
typename SuperMeta1,typename TagList1, | |
typename SuperMeta2,typename TagList2 | |
> | |
bool operator<=( | |
const sequenced_index<SuperMeta1,TagList1>& x, | |
const sequenced_index<SuperMeta2,TagList2>& y) | |
{ | |
return !(x>y); | |
} | |
/* specialized algorithms */ | |
template<typename SuperMeta,typename TagList> | |
void swap( | |
sequenced_index<SuperMeta,TagList>& x, | |
sequenced_index<SuperMeta,TagList>& y) | |
{ | |
x.swap(y); | |
} | |
} /* namespace multi_index::detail */ | |
/* sequenced index specifier */ | |
template <typename TagList> | |
struct sequenced | |
{ | |
BOOST_STATIC_ASSERT(detail::is_tag<TagList>::value); | |
template<typename Super> | |
struct node_class | |
{ | |
typedef detail::sequenced_index_node<Super> type; | |
}; | |
template<typename SuperMeta> | |
struct index_class | |
{ | |
typedef detail::sequenced_index<SuperMeta,typename TagList::type> type; | |
}; | |
}; | |
} /* namespace multi_index */ | |
} /* namespace boost */ | |
#undef BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT | |
#endif |