williamr@2: /* Copyright 2003-2007 Joaquín M López Muñoz. williamr@2: * Distributed under the Boost Software License, Version 1.0. williamr@2: * (See accompanying file LICENSE_1_0.txt or copy at williamr@2: * http://www.boost.org/LICENSE_1_0.txt) williamr@2: * williamr@2: * See http://www.boost.org/libs/multi_index for library home page. williamr@2: * williamr@2: * The internal implementation of red-black trees is based on that of SGI STL williamr@2: * stl_tree.h file: williamr@2: * williamr@2: * Copyright (c) 1996,1997 williamr@2: * Silicon Graphics Computer Systems, Inc. williamr@2: * williamr@2: * Permission to use, copy, modify, distribute and sell this software williamr@2: * and its documentation for any purpose is hereby granted without fee, williamr@2: * provided that the above copyright notice appear in all copies and williamr@2: * that both that copyright notice and this permission notice appear williamr@2: * in supporting documentation. Silicon Graphics makes no williamr@2: * representations about the suitability of this software for any williamr@2: * purpose. It is provided "as is" without express or implied warranty. williamr@2: * williamr@2: * williamr@2: * Copyright (c) 1994 williamr@2: * Hewlett-Packard Company williamr@2: * williamr@2: * Permission to use, copy, modify, distribute and sell this software williamr@2: * and its documentation for any purpose is hereby granted without fee, williamr@2: * provided that the above copyright notice appear in all copies and williamr@2: * that both that copyright notice and this permission notice appear williamr@2: * in supporting documentation. Hewlett-Packard Company makes no williamr@2: * representations about the suitability of this software for any williamr@2: * purpose. It is provided "as is" without express or implied warranty. williamr@2: * williamr@2: */ williamr@2: williamr@2: #ifndef BOOST_MULTI_INDEX_ORDERED_INDEX_HPP williamr@2: #define BOOST_MULTI_INDEX_ORDERED_INDEX_HPP williamr@2: williamr@2: #if defined(_MSC_VER)&&(_MSC_VER>=1200) williamr@2: #pragma once williamr@2: #endif williamr@2: williamr@2: #include /* keep it first to prevent nasty warns in MSVC */ williamr@2: #include williamr@2: #include williamr@2: #include williamr@2: #include williamr@2: #include williamr@2: #include williamr@2: #include williamr@2: #include williamr@2: #include williamr@2: #include williamr@2: #include williamr@2: #include williamr@2: #include williamr@2: #include williamr@2: #include williamr@2: #include williamr@2: #include williamr@2: #include williamr@2: #include williamr@2: #include williamr@2: williamr@2: #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) williamr@2: #include williamr@2: #include williamr@2: #include williamr@2: #include williamr@2: #endif williamr@2: williamr@2: #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING) williamr@2: #define BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT \ williamr@2: detail::scope_guard BOOST_JOIN(check_invariant_,__LINE__)= \ williamr@2: detail::make_obj_guard(*this,&ordered_index::check_invariant_); \ williamr@2: BOOST_JOIN(check_invariant_,__LINE__).touch(); williamr@2: #else williamr@2: #define BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT williamr@2: #endif williamr@2: williamr@2: namespace boost{ williamr@2: williamr@2: namespace multi_index{ williamr@2: williamr@2: namespace detail{ williamr@2: williamr@2: /* ordered_index adds a layer of ordered indexing to a given Super */ williamr@2: williamr@2: /* Most of the implementation of unique and non-unique indices is williamr@2: * shared. We tell from one another on instantiation time by using williamr@2: * these tags. williamr@2: */ williamr@2: williamr@2: struct ordered_unique_tag{}; williamr@2: struct ordered_non_unique_tag{}; williamr@2: williamr@2: template< williamr@2: typename KeyFromValue,typename Compare, williamr@2: typename SuperMeta,typename TagList,typename Category williamr@2: > williamr@2: class ordered_index: williamr@2: BOOST_MULTI_INDEX_PROTECTED_IF_MEMBER_TEMPLATE_FRIENDS SuperMeta::type williamr@2: williamr@2: #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) williamr@2: #if BOOST_WORKAROUND(BOOST_MSVC,<1300) williamr@2: ,public safe_ctr_proxy_impl< williamr@2: bidir_node_iterator< williamr@2: ordered_index_node >, williamr@2: ordered_index > williamr@2: #else williamr@2: ,public safe_mode::safe_container< williamr@2: ordered_index > williamr@2: #endif williamr@2: #endif williamr@2: williamr@2: { williamr@2: #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING)&&\ williamr@2: BOOST_WORKAROUND(__MWERKS__,<=0x3003) williamr@2: /* The "ISO C++ Template Parser" option in CW8.3 has a problem with the williamr@2: * lifetime of const references bound to temporaries --precisely what williamr@2: * scopeguards are. williamr@2: */ williamr@2: williamr@2: #pragma parse_mfunc_templ off williamr@2: #endif williamr@2: williamr@2: typedef typename SuperMeta::type super; williamr@2: williamr@2: protected: williamr@2: typedef ordered_index_node< williamr@2: typename super::node_type> node_type; williamr@2: williamr@2: public: williamr@2: /* types */ williamr@2: williamr@2: typedef typename KeyFromValue::result_type key_type; williamr@2: typedef typename node_type::value_type value_type; williamr@2: typedef KeyFromValue key_from_value; williamr@2: typedef Compare key_compare; williamr@2: typedef value_comparison< williamr@2: value_type,KeyFromValue,Compare> value_compare; williamr@2: typedef tuple ctor_args; williamr@2: typedef typename super::final_allocator_type allocator_type; williamr@2: typedef typename allocator_type::reference reference; williamr@2: typedef typename allocator_type::const_reference const_reference; williamr@2: williamr@2: #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) williamr@2: #if BOOST_WORKAROUND(BOOST_MSVC,<1300) williamr@2: typedef safe_mode::safe_iterator< williamr@2: bidir_node_iterator, williamr@2: safe_ctr_proxy< williamr@2: bidir_node_iterator > > iterator; williamr@2: #else williamr@2: typedef safe_mode::safe_iterator< williamr@2: bidir_node_iterator, williamr@2: ordered_index> iterator; williamr@2: #endif williamr@2: #else williamr@2: typedef bidir_node_iterator iterator; williamr@2: #endif williamr@2: williamr@2: typedef iterator const_iterator; williamr@2: williamr@2: typedef std::size_t size_type; williamr@2: typedef std::ptrdiff_t difference_type; williamr@2: typedef typename allocator_type::pointer pointer; williamr@2: typedef typename allocator_type::const_pointer const_pointer; williamr@2: typedef typename williamr@2: boost::reverse_iterator reverse_iterator; williamr@2: typedef typename williamr@2: boost::reverse_iterator const_reverse_iterator; williamr@2: typedef TagList tag_list; williamr@2: williamr@2: protected: williamr@2: typedef typename super::final_node_type final_node_type; williamr@2: typedef tuples::cons< williamr@2: ctor_args, williamr@2: typename super::ctor_args_list> ctor_args_list; williamr@2: typedef typename mpl::push_front< williamr@2: typename super::index_type_list, williamr@2: ordered_index>::type index_type_list; williamr@2: typedef typename mpl::push_front< williamr@2: typename super::iterator_type_list, williamr@2: iterator>::type iterator_type_list; williamr@2: typedef typename mpl::push_front< williamr@2: typename super::const_iterator_type_list, williamr@2: const_iterator>::type const_iterator_type_list; williamr@2: typedef typename super::copy_map_type copy_map_type; williamr@2: williamr@2: #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) williamr@2: typedef typename super::index_saver_type index_saver_type; williamr@2: typedef typename super::index_loader_type index_loader_type; williamr@2: #endif williamr@2: williamr@2: private: williamr@2: #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) williamr@2: #if BOOST_WORKAROUND(BOOST_MSVC,<1300) williamr@2: typedef safe_ctr_proxy_impl< williamr@2: bidir_node_iterator, williamr@2: ordered_index> safe_super; williamr@2: #else williamr@2: typedef safe_mode::safe_container safe_super; williamr@2: #endif williamr@2: #endif williamr@2: williamr@2: typedef typename call_traits< williamr@2: value_type>::param_type value_param_type; williamr@2: typedef typename call_traits< williamr@2: key_type>::param_type key_param_type; williamr@2: williamr@2: public: williamr@2: williamr@2: /* construct/copy/destroy williamr@2: * Default and copy ctors are in the protected section as indices are williamr@2: * not supposed to be created on their own. No range ctor either. williamr@2: */ williamr@2: williamr@2: ordered_index& operator=( williamr@2: const ordered_index& x) williamr@2: { williamr@2: this->final()=x.final(); williamr@2: return *this; williamr@2: } williamr@2: williamr@2: allocator_type get_allocator()const williamr@2: { williamr@2: return this->final().get_allocator(); williamr@2: } williamr@2: williamr@2: /* iterators */ williamr@2: williamr@2: iterator begin(){return make_iterator(leftmost());} williamr@2: const_iterator begin()const{return make_iterator(leftmost());} williamr@2: iterator end(){return make_iterator(header());} williamr@2: const_iterator end()const{return make_iterator(header());} williamr@2: reverse_iterator rbegin(){return make_reverse_iterator(end());} williamr@2: const_reverse_iterator rbegin()const{return make_reverse_iterator(end());} williamr@2: reverse_iterator rend(){return make_reverse_iterator(begin());} williamr@2: const_reverse_iterator rend()const{return make_reverse_iterator(begin());} williamr@2: williamr@2: /* capacity */ williamr@2: williamr@2: bool empty()const{return this->final_empty_();} williamr@2: size_type size()const{return this->final_size_();} williamr@2: size_type max_size()const{return this->final_max_size_();} williamr@2: williamr@2: /* modifiers */ williamr@2: williamr@2: std::pair insert(value_param_type x) williamr@2: { williamr@2: BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; williamr@2: std::pair p=this->final_insert_(x); williamr@2: return std::pair(make_iterator(p.first),p.second); williamr@2: } williamr@2: williamr@2: iterator insert(iterator position,value_param_type x) williamr@2: { williamr@2: BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); williamr@2: BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); williamr@2: BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; williamr@2: std::pair p=this->final_insert_( williamr@2: x,static_cast(position.get_node())); williamr@2: return make_iterator(p.first); williamr@2: } williamr@2: williamr@2: template williamr@2: void insert(InputIterator first,InputIterator last) williamr@2: { williamr@2: BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; williamr@2: iterator hint=end(); williamr@2: for(;first!=last;++first)hint=insert(hint,*first); williamr@2: } williamr@2: williamr@2: iterator erase(iterator position) williamr@2: { williamr@2: BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); williamr@2: BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); williamr@2: BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); williamr@2: BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; williamr@2: this->final_erase_(static_cast(position++.get_node())); williamr@2: return position; williamr@2: } williamr@2: williamr@2: size_type erase(key_param_type x) williamr@2: { williamr@2: BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; williamr@2: std::pair p=equal_range(x); williamr@2: size_type s=0; williamr@2: while(p.first!=p.second){ williamr@2: p.first=erase(p.first); williamr@2: ++s; williamr@2: } williamr@2: return s; williamr@2: } williamr@2: williamr@2: iterator erase(iterator first,iterator last) williamr@2: { williamr@2: BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(first); williamr@2: BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(last); williamr@2: BOOST_MULTI_INDEX_CHECK_IS_OWNER(first,*this); williamr@2: BOOST_MULTI_INDEX_CHECK_IS_OWNER(last,*this); williamr@2: BOOST_MULTI_INDEX_CHECK_VALID_RANGE(first,last); williamr@2: BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; williamr@2: while(first!=last){ williamr@2: first=erase(first); williamr@2: } williamr@2: return first; williamr@2: } williamr@2: williamr@2: bool replace(iterator position,value_param_type x) williamr@2: { williamr@2: BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); williamr@2: BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); williamr@2: BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); williamr@2: BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; williamr@2: return this->final_replace_( williamr@2: x,static_cast(position.get_node())); williamr@2: } williamr@2: williamr@2: template williamr@2: bool modify(iterator position,Modifier mod) williamr@2: { williamr@2: BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); williamr@2: BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); williamr@2: BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); williamr@2: BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; williamr@2: williamr@2: #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) williamr@2: /* MSVC++ 6.0 optimizer on safe mode code chokes if this williamr@2: * this is not added. Left it for all compilers as it does no williamr@2: * harm. williamr@2: */ williamr@2: williamr@2: position.detach(); williamr@2: #endif williamr@2: williamr@2: return this->final_modify_( williamr@2: mod,static_cast(position.get_node())); williamr@2: } williamr@2: williamr@2: template williamr@2: bool modify_key(iterator position,Modifier mod) williamr@2: { williamr@2: BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); williamr@2: BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); williamr@2: BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); williamr@2: BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; williamr@2: return modify( williamr@2: position,modify_key_adaptor(mod,key)); williamr@2: } williamr@2: williamr@2: void swap(ordered_index& x) williamr@2: { williamr@2: BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; williamr@2: this->final_swap_(x.final()); williamr@2: } williamr@2: williamr@2: void clear() williamr@2: { williamr@2: BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; williamr@2: this->final_clear_(); williamr@2: } williamr@2: williamr@2: /* observers */ williamr@2: williamr@2: key_from_value key_extractor()const{return key;} williamr@2: key_compare key_comp()const{return comp;} williamr@2: value_compare value_comp()const{return value_compare(key,comp);} williamr@2: williamr@2: /* set operations */ williamr@2: williamr@2: /* Internally, these ops rely on const_iterator being the same williamr@2: * type as iterator. williamr@2: */ williamr@2: williamr@2: template williamr@2: iterator find(const CompatibleKey& x)const williamr@2: { williamr@2: return make_iterator(ordered_index_find(header(),key,x,comp)); williamr@2: } williamr@2: williamr@2: template williamr@2: iterator find( williamr@2: const CompatibleKey& x,const CompatibleCompare& comp)const williamr@2: { williamr@2: return make_iterator(ordered_index_find(header(),key,x,comp)); williamr@2: } williamr@2: williamr@2: template williamr@2: size_type count(const CompatibleKey& x)const williamr@2: { williamr@2: return count(x,comp); williamr@2: } williamr@2: williamr@2: template williamr@2: size_type count(const CompatibleKey& x,const CompatibleCompare& comp)const williamr@2: { williamr@2: std::pair p=equal_range(x,comp); williamr@2: size_type n=std::distance(p.first,p.second); williamr@2: return n; williamr@2: } williamr@2: williamr@2: template williamr@2: iterator lower_bound(const CompatibleKey& x)const williamr@2: { williamr@2: return make_iterator(ordered_index_lower_bound(header(),key,x,comp)); williamr@2: } williamr@2: williamr@2: template williamr@2: iterator lower_bound( williamr@2: const CompatibleKey& x,const CompatibleCompare& comp)const williamr@2: { williamr@2: return make_iterator(ordered_index_lower_bound(header(),key,x,comp)); williamr@2: } williamr@2: williamr@2: template williamr@2: iterator upper_bound(const CompatibleKey& x)const williamr@2: { williamr@2: return make_iterator(ordered_index_upper_bound(header(),key,x,comp)); williamr@2: } williamr@2: williamr@2: template williamr@2: iterator upper_bound( williamr@2: const CompatibleKey& x,const CompatibleCompare& comp)const williamr@2: { williamr@2: return make_iterator(ordered_index_upper_bound(header(),key,x,comp)); williamr@2: } williamr@2: williamr@2: template williamr@2: std::pair equal_range( williamr@2: const CompatibleKey& x)const williamr@2: { williamr@2: return equal_range(x,comp); williamr@2: } williamr@2: williamr@2: template williamr@2: std::pair equal_range( williamr@2: const CompatibleKey& x,const CompatibleCompare& comp)const williamr@2: { williamr@2: return std::pair( williamr@2: lower_bound(x,comp),upper_bound(x,comp)); williamr@2: } williamr@2: williamr@2: /* range */ williamr@2: williamr@2: template williamr@2: std::pair williamr@2: range(LowerBounder lower,UpperBounder upper)const williamr@2: { williamr@2: std::pair p( williamr@2: lower_range(lower),upper_range(upper)); williamr@2: if(p.second!=end()&&(p.first==end()||comp(key(*p.second),key(*p.first)))){ williamr@2: p.second=p.first; williamr@2: } williamr@2: return p; williamr@2: } williamr@2: williamr@2: BOOST_MULTI_INDEX_PROTECTED_IF_MEMBER_TEMPLATE_FRIENDS: williamr@2: ordered_index(const ctor_args_list& args_list,const allocator_type& al): williamr@2: super(args_list.get_tail(),al), williamr@2: key(tuples::get<0>(args_list.get_head())), williamr@2: comp(tuples::get<1>(args_list.get_head())) williamr@2: { williamr@2: empty_initialize(); williamr@2: } williamr@2: williamr@2: ordered_index( williamr@2: const ordered_index& x): williamr@2: super(x), williamr@2: williamr@2: #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) williamr@2: safe_super(), williamr@2: #endif williamr@2: williamr@2: key(x.key), williamr@2: comp(x.comp) williamr@2: { williamr@2: /* Copy ctor just takes the key and compare objects from x. The rest is williamr@2: * done in subsequent call to copy_(). williamr@2: */ williamr@2: } williamr@2: williamr@2: ~ordered_index() williamr@2: { williamr@2: /* the container is guaranteed to be empty by now */ williamr@2: } williamr@2: williamr@2: #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) williamr@2: iterator make_iterator(node_type* node){return iterator(node,this);} williamr@2: const_iterator make_iterator(node_type* node)const williamr@2: {return const_iterator(node,const_cast(this));} williamr@2: #else williamr@2: iterator make_iterator(node_type* node){return iterator(node);} williamr@2: const_iterator make_iterator(node_type* node)const williamr@2: {return const_iterator(node);} williamr@2: #endif williamr@2: williamr@2: void copy_( williamr@2: const ordered_index& x, williamr@2: const copy_map_type& map) williamr@2: { williamr@2: if(!x.root()){ williamr@2: empty_initialize(); williamr@2: } williamr@2: else{ williamr@2: header()->color()=x.header()->color(); williamr@2: williamr@2: node_type* root_cpy=map.find(static_cast(x.root())); williamr@2: header()->parent()=root_cpy->impl(); williamr@2: williamr@2: node_type* leftmost_cpy=map.find( williamr@2: static_cast(x.leftmost())); williamr@2: header()->left()=leftmost_cpy->impl(); williamr@2: williamr@2: node_type* rightmost_cpy=map.find( williamr@2: static_cast(x.rightmost())); williamr@2: header()->right()=rightmost_cpy->impl(); williamr@2: williamr@2: typedef typename copy_map_type::const_iterator copy_map_iterator; williamr@2: for(copy_map_iterator it=map.begin(),it_end=map.end();it!=it_end;++it){ williamr@2: node_type* org=it->first; williamr@2: node_type* cpy=it->second; williamr@2: williamr@2: cpy->color()=org->color(); williamr@2: williamr@2: ordered_index_node_impl* parent_org=org->parent(); williamr@2: if(!parent_org)cpy->parent()=0; williamr@2: else{ williamr@2: node_type* parent_cpy=map.find( williamr@2: static_cast(node_type::from_impl(parent_org))); williamr@2: cpy->parent()=parent_cpy->impl(); williamr@2: if(parent_org->left()==org->impl()){ williamr@2: parent_cpy->left()=cpy->impl(); williamr@2: } williamr@2: else if(parent_org->right()==org->impl()){ williamr@2: /* header() does not satisfy this nor the previous check */ williamr@2: parent_cpy->right()=cpy->impl(); williamr@2: } williamr@2: } williamr@2: williamr@2: if(!org->left())cpy->left()=0; williamr@2: if(!org->right())cpy->right()=0; williamr@2: } williamr@2: } williamr@2: williamr@2: super::copy_(x,map); williamr@2: } williamr@2: williamr@2: node_type* insert_(value_param_type v,node_type* x) williamr@2: { williamr@2: link_info inf; williamr@2: if(!link_point(key(v),inf,Category())){ williamr@2: return node_type::from_impl(inf.pos); williamr@2: } williamr@2: williamr@2: node_type* res=static_cast(super::insert_(v,x)); williamr@2: if(res==x){ williamr@2: ordered_index_node_impl::link( williamr@2: x->impl(),inf.side,inf.pos,header()->impl()); williamr@2: } williamr@2: return res; williamr@2: } williamr@2: williamr@2: node_type* insert_(value_param_type v,node_type* position,node_type* x) williamr@2: { williamr@2: link_info inf; williamr@2: if(!hinted_link_point(key(v),position,inf,Category())){ williamr@2: return node_type::from_impl(inf.pos); williamr@2: } williamr@2: williamr@2: node_type* res=static_cast(super::insert_(v,position,x)); williamr@2: if(res==x){ williamr@2: ordered_index_node_impl::link( williamr@2: x->impl(),inf.side,inf.pos,header()->impl()); williamr@2: } williamr@2: return res; williamr@2: } williamr@2: williamr@2: void erase_(node_type* x) williamr@2: { williamr@2: ordered_index_node_impl::rebalance_for_erase( williamr@2: x->impl(),header()->parent(),header()->left(),header()->right()); williamr@2: super::erase_(x); williamr@2: williamr@2: #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) williamr@2: detach_iterators(x); williamr@2: #endif williamr@2: } williamr@2: williamr@2: void delete_all_nodes_() williamr@2: { williamr@2: delete_all_nodes(root()); williamr@2: } williamr@2: williamr@2: void clear_() williamr@2: { williamr@2: super::clear_(); williamr@2: empty_initialize(); williamr@2: williamr@2: #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) williamr@2: safe_super::detach_dereferenceable_iterators(); williamr@2: #endif williamr@2: } williamr@2: williamr@2: void swap_(ordered_index& x) williamr@2: { williamr@2: std::swap(key,x.key); williamr@2: std::swap(comp,x.comp); williamr@2: williamr@2: #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) williamr@2: safe_super::swap(x); williamr@2: #endif williamr@2: williamr@2: super::swap_(x); williamr@2: } williamr@2: williamr@2: bool replace_(value_param_type v,node_type* x) williamr@2: { williamr@2: if(in_place(v,x,Category())){ williamr@2: return super::replace_(v,x); williamr@2: } williamr@2: williamr@2: node_type* next=x; williamr@2: node_type::increment(next); williamr@2: williamr@2: ordered_index_node_impl::rebalance_for_erase( williamr@2: x->impl(),header()->parent(),header()->left(),header()->right()); williamr@2: williamr@2: BOOST_TRY{ williamr@2: link_info inf; williamr@2: if(link_point(key(v),inf,Category())&&super::replace_(v,x)){ williamr@2: ordered_index_node_impl::link( williamr@2: x->impl(),inf.side,inf.pos,header()->impl()); williamr@2: return true; williamr@2: } williamr@2: ordered_index_node_impl::restore( williamr@2: x->impl(),next->impl(),header()->impl()); williamr@2: return false; williamr@2: } williamr@2: BOOST_CATCH(...){ williamr@2: ordered_index_node_impl::restore( williamr@2: x->impl(),next->impl(),header()->impl()); williamr@2: BOOST_RETHROW; williamr@2: } williamr@2: BOOST_CATCH_END williamr@2: } williamr@2: williamr@2: bool modify_(node_type* x) williamr@2: { williamr@2: bool b; williamr@2: BOOST_TRY{ williamr@2: b=in_place(x->value(),x,Category()); williamr@2: } williamr@2: BOOST_CATCH(...){ williamr@2: erase_(x); williamr@2: BOOST_RETHROW; williamr@2: } williamr@2: BOOST_CATCH_END williamr@2: if(!b){ williamr@2: ordered_index_node_impl::rebalance_for_erase( williamr@2: x->impl(),header()->parent(),header()->left(),header()->right()); williamr@2: BOOST_TRY{ williamr@2: link_info inf; williamr@2: if(!link_point(key(x->value()),inf,Category())){ williamr@2: super::erase_(x); williamr@2: williamr@2: #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) williamr@2: detach_iterators(x); williamr@2: #endif williamr@2: return false; williamr@2: } williamr@2: ordered_index_node_impl::link( williamr@2: x->impl(),inf.side,inf.pos,header()->impl()); williamr@2: } williamr@2: BOOST_CATCH(...){ williamr@2: super::erase_(x); williamr@2: williamr@2: #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) williamr@2: detach_iterators(x); williamr@2: #endif williamr@2: williamr@2: BOOST_RETHROW; williamr@2: } williamr@2: BOOST_CATCH_END williamr@2: } williamr@2: williamr@2: BOOST_TRY{ williamr@2: if(!super::modify_(x)){ williamr@2: ordered_index_node_impl::rebalance_for_erase( williamr@2: x->impl(),header()->parent(),header()->left(),header()->right()); williamr@2: williamr@2: #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) williamr@2: detach_iterators(x); williamr@2: #endif williamr@2: williamr@2: return false; williamr@2: } williamr@2: else return true; williamr@2: } williamr@2: BOOST_CATCH(...){ williamr@2: ordered_index_node_impl::rebalance_for_erase( williamr@2: x->impl(),header()->parent(),header()->left(),header()->right()); williamr@2: williamr@2: #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) williamr@2: detach_iterators(x); williamr@2: #endif williamr@2: williamr@2: BOOST_RETHROW; williamr@2: } williamr@2: BOOST_CATCH_END williamr@2: } williamr@2: williamr@2: #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) williamr@2: /* serialization */ williamr@2: williamr@2: template williamr@2: void save_( williamr@2: Archive& ar,const unsigned int version,const index_saver_type& sm)const williamr@2: { williamr@2: save_(ar,version,sm,Category()); williamr@2: } williamr@2: williamr@2: template williamr@2: void load_(Archive& ar,const unsigned int version,const index_loader_type& lm) williamr@2: { williamr@2: load_(ar,version,lm,Category()); williamr@2: } williamr@2: #endif williamr@2: williamr@2: #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING) williamr@2: /* invariant stuff */ williamr@2: williamr@2: bool invariant_()const williamr@2: { williamr@2: if(size()==0||begin()==end()){ williamr@2: if(size()!=0||begin()!=end()|| williamr@2: header()->left()!=header()->impl()|| williamr@2: header()->right()!=header()->impl())return false; williamr@2: } williamr@2: else{ williamr@2: if((size_type)std::distance(begin(),end())!=size())return false; williamr@2: williamr@2: std::size_t len=ordered_index_node_impl::black_count( williamr@2: leftmost()->impl(),root()->impl()); williamr@2: for(const_iterator it=begin(),it_end=end();it!=it_end;++it){ williamr@2: node_type* x=it.get_node(); williamr@2: node_type* left_x=node_type::from_impl(x->left()); williamr@2: node_type* right_x=node_type::from_impl(x->right()); williamr@2: williamr@2: if(x->color()==red){ williamr@2: if((left_x&&left_x->color()==red)|| williamr@2: (right_x&&right_x->color()==red))return false; williamr@2: } williamr@2: if(left_x&&comp(key(x->value()),key(left_x->value())))return false; williamr@2: if(right_x&&comp(key(right_x->value()),key(x->value())))return false; williamr@2: if(!left_x&&!right_x&& williamr@2: ordered_index_node_impl::black_count( williamr@2: x->impl(),root()->impl())!=len) williamr@2: return false; williamr@2: } williamr@2: williamr@2: if(leftmost()->impl()!= williamr@2: ordered_index_node_impl::minimum(root()->impl())) williamr@2: return false; williamr@2: if(rightmost()->impl()!= williamr@2: ordered_index_node_impl::maximum(root()->impl())) williamr@2: return false; williamr@2: } williamr@2: williamr@2: return super::invariant_(); williamr@2: } williamr@2: williamr@2: williamr@2: /* This forwarding function eases things for the boost::mem_fn construct williamr@2: * in BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT. Actually, williamr@2: * final_check_invariant is already an inherited member function of williamr@2: * ordered_index. williamr@2: */ williamr@2: void check_invariant_()const{this->final_check_invariant_();} williamr@2: #endif williamr@2: williamr@2: private: williamr@2: node_type* header()const{return this->final_header();} williamr@2: node_type* root()const{return node_type::from_impl(header()->parent());} williamr@2: node_type* leftmost()const{return node_type::from_impl(header()->left());} williamr@2: node_type* rightmost()const{return node_type::from_impl(header()->right());} williamr@2: williamr@2: void empty_initialize() williamr@2: { williamr@2: header()->color()=red; williamr@2: /* used to distinguish header() from root, in iterator.operator++ */ williamr@2: williamr@2: header()->parent()=0; williamr@2: header()->left()=header()->impl(); williamr@2: header()->right()=header()->impl(); williamr@2: } williamr@2: williamr@2: struct link_info williamr@2: { williamr@2: ordered_index_side side; williamr@2: ordered_index_node_impl* pos; williamr@2: }; williamr@2: williamr@2: bool link_point(key_param_type k,link_info& inf,ordered_unique_tag) williamr@2: { williamr@2: node_type* y=header(); williamr@2: node_type* x=root(); williamr@2: bool c=true; williamr@2: while(x){ williamr@2: y=x; williamr@2: c=comp(k,key(x->value())); williamr@2: x=node_type::from_impl(c?x->left():x->right()); williamr@2: } williamr@2: node_type* yy=y; williamr@2: if(c){ williamr@2: if(yy==leftmost()){ williamr@2: inf.side=to_left; williamr@2: inf.pos=y->impl(); williamr@2: return true; williamr@2: } williamr@2: else node_type::decrement(yy); williamr@2: } williamr@2: williamr@2: if(comp(key(yy->value()),k)){ williamr@2: inf.side=c?to_left:to_right; williamr@2: inf.pos=y->impl(); williamr@2: return true; williamr@2: } williamr@2: else{ williamr@2: inf.pos=yy->impl(); williamr@2: return false; williamr@2: } williamr@2: } williamr@2: williamr@2: bool link_point(key_param_type k,link_info& inf,ordered_non_unique_tag) williamr@2: { williamr@2: node_type* y=header(); williamr@2: node_type* x=root(); williamr@2: bool c=true; williamr@2: while (x){ williamr@2: y=x; williamr@2: c=comp(k,key(x->value())); williamr@2: x=node_type::from_impl(c?x->left():x->right()); williamr@2: } williamr@2: inf.side=c?to_left:to_right; williamr@2: inf.pos=y->impl(); williamr@2: return true; williamr@2: } williamr@2: williamr@2: bool hinted_link_point( williamr@2: key_param_type k,node_type* position,link_info& inf,ordered_unique_tag) williamr@2: { williamr@2: if(position->impl()==header()->left()){ williamr@2: if(size()>0&&comp(k,key(position->value()))){ williamr@2: inf.side=to_left; williamr@2: inf.pos=position->impl(); williamr@2: return true; williamr@2: } williamr@2: else return link_point(k,inf,ordered_unique_tag()); williamr@2: } williamr@2: else if(position==header()){ williamr@2: if(comp(key(rightmost()->value()),k)){ williamr@2: inf.side=to_right; williamr@2: inf.pos=rightmost()->impl(); williamr@2: return true; williamr@2: } williamr@2: else return link_point(k,inf,ordered_unique_tag()); williamr@2: } williamr@2: else{ williamr@2: node_type* before=position; williamr@2: node_type::decrement(before); williamr@2: if(comp(key(before->value()),k)&&comp(k,key(position->value()))){ williamr@2: if(before->right()==0){ williamr@2: inf.side=to_right; williamr@2: inf.pos=before->impl(); williamr@2: return true; williamr@2: } williamr@2: else{ williamr@2: inf.side=to_left; williamr@2: inf.pos=position->impl(); williamr@2: return true; williamr@2: } williamr@2: } williamr@2: else return link_point(k,inf,ordered_unique_tag()); williamr@2: } williamr@2: } williamr@2: williamr@2: bool hinted_link_point( williamr@2: key_param_type k,node_type* position,link_info& inf,ordered_non_unique_tag) williamr@2: { williamr@2: if(position->impl()==header()->left()){ williamr@2: if(size()>0&&!comp(key(position->value()),k)){ williamr@2: inf.side=to_left; williamr@2: inf.pos=position->impl(); williamr@2: return true; williamr@2: } williamr@2: else return link_point(k,inf,ordered_non_unique_tag()); williamr@2: } williamr@2: else if(position==header()){ williamr@2: if(!comp(k,key(rightmost()->value()))){ williamr@2: inf.side=to_right; williamr@2: inf.pos=rightmost()->impl(); williamr@2: return true; williamr@2: } williamr@2: else return link_point(k,inf,ordered_non_unique_tag()); williamr@2: } williamr@2: else{ williamr@2: node_type* before=position; williamr@2: node_type::decrement(before); williamr@2: if (!comp(k,key(before->value()))&&!comp(key(position->value()),k)){ williamr@2: if(before->right()==0){ williamr@2: inf.side=to_right; williamr@2: inf.pos=before->impl(); williamr@2: return true; williamr@2: } williamr@2: else{ williamr@2: inf.side=to_left; williamr@2: inf.pos=position->impl(); williamr@2: return true; williamr@2: } williamr@2: } williamr@2: else return link_point(k,inf,ordered_non_unique_tag()); williamr@2: } williamr@2: } williamr@2: williamr@2: void delete_all_nodes(node_type* x) williamr@2: { williamr@2: if(!x)return; williamr@2: williamr@2: delete_all_nodes(node_type::from_impl(x->left())); williamr@2: delete_all_nodes(node_type::from_impl(x->right())); williamr@2: this->final_delete_node_(static_cast(x)); williamr@2: } williamr@2: williamr@2: bool in_place(value_param_type v,node_type* x,ordered_unique_tag) williamr@2: { williamr@2: node_type* y; williamr@2: if(x!=leftmost()){ williamr@2: y=x; williamr@2: node_type::decrement(y); williamr@2: if(!comp(key(y->value()),key(v)))return false; williamr@2: } williamr@2: williamr@2: y=x; williamr@2: node_type::increment(y); williamr@2: return y==header()||comp(key(v),key(y->value())); williamr@2: } williamr@2: williamr@2: bool in_place(value_param_type v,node_type* x,ordered_non_unique_tag) williamr@2: { williamr@2: node_type* y; williamr@2: if(x!=leftmost()){ williamr@2: y=x; williamr@2: node_type::decrement(y); williamr@2: if(comp(key(v),key(y->value())))return false; williamr@2: } williamr@2: williamr@2: y=x; williamr@2: node_type::increment(y); williamr@2: return y==header()||!comp(key(y->value()),key(v)); williamr@2: } williamr@2: williamr@2: #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) williamr@2: void detach_iterators(node_type* x) williamr@2: { williamr@2: iterator it=make_iterator(x); williamr@2: safe_mode::detach_equivalent_iterators(it); williamr@2: } williamr@2: #endif williamr@2: williamr@2: template williamr@2: iterator lower_range(LowerBounder lower)const williamr@2: { williamr@2: node_type* y=header(); williamr@2: node_type* z=root(); williamr@2: williamr@2: while(z){ williamr@2: if(lower(key(z->value()))){ williamr@2: y=z; williamr@2: z=node_type::from_impl(z->left()); williamr@2: } williamr@2: else z=node_type::from_impl(z->right()); williamr@2: } williamr@2: williamr@2: return make_iterator(y); williamr@2: } williamr@2: williamr@2: iterator lower_range(unbounded_type)const williamr@2: { williamr@2: return begin(); williamr@2: } williamr@2: williamr@2: template williamr@2: iterator upper_range(UpperBounder upper)const williamr@2: { williamr@2: node_type* y=header(); williamr@2: node_type* z=root(); williamr@2: williamr@2: while(z){ williamr@2: if(!upper(key(z->value()))){ williamr@2: y=z; williamr@2: z=node_type::from_impl(z->left()); williamr@2: } williamr@2: else z=node_type::from_impl(z->right()); williamr@2: } williamr@2: williamr@2: return make_iterator(y); williamr@2: } williamr@2: williamr@2: iterator upper_range(unbounded_type)const williamr@2: { williamr@2: return end(); williamr@2: } williamr@2: williamr@2: #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) williamr@2: template williamr@2: void save_( williamr@2: Archive& ar,const unsigned int version,const index_saver_type& sm, williamr@2: ordered_unique_tag)const williamr@2: { williamr@2: super::save_(ar,version,sm); williamr@2: } williamr@2: williamr@2: template williamr@2: void load_( williamr@2: Archive& ar,const unsigned int version,const index_loader_type& lm, williamr@2: ordered_unique_tag) williamr@2: { williamr@2: super::load_(ar,version,lm); williamr@2: } williamr@2: williamr@2: template williamr@2: void save_( williamr@2: Archive& ar,const unsigned int version,const index_saver_type& sm, williamr@2: ordered_non_unique_tag)const williamr@2: { williamr@2: typedef duplicates_iterator dup_iterator; williamr@2: williamr@2: sm.save( williamr@2: dup_iterator(begin().get_node(),end().get_node(),value_comp()), williamr@2: dup_iterator(end().get_node(),value_comp()), williamr@2: ar,version); williamr@2: super::save_(ar,version,sm); williamr@2: } williamr@2: williamr@2: template williamr@2: void load_( williamr@2: Archive& ar,const unsigned int version,const index_loader_type& lm, williamr@2: ordered_non_unique_tag) williamr@2: { williamr@2: lm.load( williamr@2: ::boost::bind(&ordered_index::rearranger,this,_1,_2), williamr@2: ar,version); williamr@2: super::load_(ar,version,lm); williamr@2: } williamr@2: williamr@2: void rearranger(node_type* position,node_type *x) williamr@2: { williamr@2: if(!position||comp(key(position->value()),key(x->value()))){ williamr@2: position=lower_bound(key(x->value())).get_node(); williamr@2: } williamr@2: else if(comp(key(x->value()),key(position->value()))){ williamr@2: /* inconsistent rearrangement */ williamr@2: throw_exception( williamr@2: archive::archive_exception( williamr@2: archive::archive_exception::other_exception)); williamr@2: } williamr@2: else node_type::increment(position); williamr@2: williamr@2: if(position!=x){ williamr@2: ordered_index_node_impl::rebalance_for_erase( williamr@2: x->impl(),header()->parent(),header()->left(),header()->right()); williamr@2: ordered_index_node_impl::restore( williamr@2: x->impl(),position->impl(),header()->impl()); williamr@2: } williamr@2: } williamr@2: #endif /* serialization */ williamr@2: williamr@2: key_from_value key; williamr@2: key_compare comp; williamr@2: williamr@2: #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING)&&\ williamr@2: BOOST_WORKAROUND(__MWERKS__,<=0x3003) williamr@2: #pragma parse_mfunc_templ reset williamr@2: #endif williamr@2: }; williamr@2: williamr@2: /* comparison */ williamr@2: williamr@2: template< williamr@2: typename KeyFromValue1,typename Compare1, williamr@2: typename SuperMeta1,typename TagList1,typename Category1, williamr@2: typename KeyFromValue2,typename Compare2, williamr@2: typename SuperMeta2,typename TagList2,typename Category2 williamr@2: > williamr@2: bool operator==( williamr@2: const ordered_index& x, williamr@2: const ordered_index& y) williamr@2: { williamr@2: return x.size()==y.size()&&std::equal(x.begin(),x.end(),y.begin()); williamr@2: } williamr@2: williamr@2: template< williamr@2: typename KeyFromValue1,typename Compare1, williamr@2: typename SuperMeta1,typename TagList1,typename Category1, williamr@2: typename KeyFromValue2,typename Compare2, williamr@2: typename SuperMeta2,typename TagList2,typename Category2 williamr@2: > williamr@2: bool operator<( williamr@2: const ordered_index& x, williamr@2: const ordered_index& y) williamr@2: { williamr@2: return std::lexicographical_compare(x.begin(),x.end(),y.begin(),y.end()); williamr@2: } williamr@2: williamr@2: template< williamr@2: typename KeyFromValue1,typename Compare1, williamr@2: typename SuperMeta1,typename TagList1,typename Category1, williamr@2: typename KeyFromValue2,typename Compare2, williamr@2: typename SuperMeta2,typename TagList2,typename Category2 williamr@2: > williamr@2: bool operator!=( williamr@2: const ordered_index& x, williamr@2: const ordered_index& y) williamr@2: { williamr@2: return !(x==y); williamr@2: } williamr@2: williamr@2: template< williamr@2: typename KeyFromValue1,typename Compare1, williamr@2: typename SuperMeta1,typename TagList1,typename Category1, williamr@2: typename KeyFromValue2,typename Compare2, williamr@2: typename SuperMeta2,typename TagList2,typename Category2 williamr@2: > williamr@2: bool operator>( williamr@2: const ordered_index& x, williamr@2: const ordered_index& y) williamr@2: { williamr@2: return y williamr@2: bool operator>=( williamr@2: const ordered_index& x, williamr@2: const ordered_index& y) williamr@2: { williamr@2: return !(x williamr@2: bool operator<=( williamr@2: const ordered_index& x, williamr@2: const ordered_index& y) williamr@2: { williamr@2: return !(x>y); williamr@2: } williamr@2: williamr@2: /* specialized algorithms */ williamr@2: williamr@2: template< williamr@2: typename KeyFromValue,typename Compare, williamr@2: typename SuperMeta,typename TagList,typename Category williamr@2: > williamr@2: void swap( williamr@2: ordered_index& x, williamr@2: ordered_index& y) williamr@2: { williamr@2: x.swap(y); williamr@2: } williamr@2: williamr@2: } /* namespace multi_index::detail */ williamr@2: williamr@2: /* ordered_index specifiers */ williamr@2: williamr@2: template williamr@2: struct ordered_unique williamr@2: { williamr@2: typedef typename detail::ordered_index_args< williamr@2: Arg1,Arg2,Arg3> index_args; williamr@2: typedef typename index_args::tag_list_type::type tag_list_type; williamr@2: typedef typename index_args::key_from_value_type key_from_value_type; williamr@2: typedef typename index_args::compare_type compare_type; williamr@2: williamr@2: template williamr@2: struct node_class williamr@2: { williamr@2: typedef detail::ordered_index_node type; williamr@2: }; williamr@2: williamr@2: template williamr@2: struct index_class williamr@2: { williamr@2: typedef detail::ordered_index< williamr@2: key_from_value_type,compare_type, williamr@2: SuperMeta,tag_list_type,detail::ordered_unique_tag> type; williamr@2: }; williamr@2: }; williamr@2: williamr@2: template williamr@2: struct ordered_non_unique williamr@2: { williamr@2: typedef detail::ordered_index_args< williamr@2: Arg1,Arg2,Arg3> index_args; williamr@2: typedef typename index_args::tag_list_type::type tag_list_type; williamr@2: typedef typename index_args::key_from_value_type key_from_value_type; williamr@2: typedef typename index_args::compare_type compare_type; williamr@2: williamr@2: template williamr@2: struct node_class williamr@2: { williamr@2: typedef detail::ordered_index_node type; williamr@2: }; williamr@2: williamr@2: template williamr@2: struct index_class williamr@2: { williamr@2: typedef detail::ordered_index< williamr@2: key_from_value_type,compare_type, williamr@2: SuperMeta,tag_list_type,detail::ordered_non_unique_tag> type; williamr@2: }; williamr@2: }; williamr@2: williamr@2: } /* namespace multi_index */ williamr@2: williamr@2: } /* namespace boost */ williamr@2: williamr@2: #undef BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT williamr@2: williamr@2: #endif