]> git.proxmox.com Git - ceph.git/blob - ceph/src/boost/boost/multi_index/detail/index_base.hpp
update source to Ceph Pacific 16.2.2
[ceph.git] / ceph / src / boost / boost / multi_index / detail / index_base.hpp
1 /* Copyright 2003-2020 Joaquin M Lopez Munoz.
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)
5 *
6 * See http://www.boost.org/libs/multi_index for library home page.
7 */
8
9 #ifndef BOOST_MULTI_INDEX_DETAIL_INDEX_BASE_HPP
10 #define BOOST_MULTI_INDEX_DETAIL_INDEX_BASE_HPP
11
12 #if defined(_MSC_VER)
13 #pragma once
14 #endif
15
16 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
17 #include <boost/core/addressof.hpp>
18 #include <boost/detail/no_exceptions_support.hpp>
19 #include <boost/detail/workaround.hpp>
20 #include <boost/move/core.hpp>
21 #include <boost/move/utility_core.hpp>
22 #include <boost/mpl/vector.hpp>
23 #include <boost/multi_index/detail/allocator_traits.hpp>
24 #include <boost/multi_index/detail/copy_map.hpp>
25 #include <boost/multi_index/detail/do_not_copy_elements_tag.hpp>
26 #include <boost/multi_index/detail/node_type.hpp>
27 #include <boost/multi_index/detail/vartempl_support.hpp>
28 #include <boost/multi_index_container_fwd.hpp>
29 #include <boost/tuple/tuple.hpp>
30 #include <utility>
31
32 #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION)
33 #include <boost/multi_index/detail/index_loader.hpp>
34 #include <boost/multi_index/detail/index_saver.hpp>
35 #endif
36
37 namespace boost{
38
39 namespace multi_index{
40
41 namespace detail{
42
43 /* The role of this class is threefold:
44 * - tops the linear hierarchy of indices.
45 * - terminates some cascading backbone function calls (insert_, etc.),
46 * - grants access to the backbone functions of the final
47 * multi_index_container class (for access restriction reasons, these
48 * cannot be called directly from the index classes.)
49 */
50
51 struct lvalue_tag{};
52 struct rvalue_tag{};
53 struct emplaced_tag{};
54
55 template<typename Value,typename IndexSpecifierList,typename Allocator>
56 class index_base
57 {
58 protected:
59 typedef index_node_base<Value,Allocator> node_type;
60 typedef typename multi_index_node_type<
61 Value,IndexSpecifierList,Allocator>::type final_node_type;
62 typedef multi_index_container<
63 Value,IndexSpecifierList,Allocator> final_type;
64 typedef tuples::null_type ctor_args_list;
65 typedef typename rebind_alloc_for<
66 Allocator,typename Allocator::value_type
67 >::type final_allocator_type;
68 typedef mpl::vector0<> index_type_list;
69 typedef mpl::vector0<> iterator_type_list;
70 typedef mpl::vector0<> const_iterator_type_list;
71 typedef copy_map<
72 final_node_type,
73 final_allocator_type> copy_map_type;
74
75 #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION)
76 typedef index_saver<
77 node_type,
78 final_allocator_type> index_saver_type;
79 typedef index_loader<
80 node_type,
81 final_node_type,
82 final_allocator_type> index_loader_type;
83 #endif
84
85 private:
86 typedef Value value_type;
87 typedef allocator_traits<Allocator> alloc_traits;
88 typedef typename alloc_traits::size_type size_type;
89
90 protected:
91 explicit index_base(const ctor_args_list&,const Allocator&){}
92
93 index_base(
94 const index_base<Value,IndexSpecifierList,Allocator>&,
95 do_not_copy_elements_tag)
96 {}
97
98 void copy_(
99 const index_base<Value,IndexSpecifierList,Allocator>&,const copy_map_type&)
100 {}
101
102 final_node_type* insert_(const value_type& v,final_node_type*& x,lvalue_tag)
103 {
104 x=final().allocate_node();
105 BOOST_TRY{
106 final().construct_value(x,v);
107 }
108 BOOST_CATCH(...){
109 final().deallocate_node(x);
110 BOOST_RETHROW;
111 }
112 BOOST_CATCH_END
113 return x;
114 }
115
116 final_node_type* insert_(const value_type& v,final_node_type*& x,rvalue_tag)
117 {
118 x=final().allocate_node();
119 BOOST_TRY{
120 final().construct_value(x,boost::move(const_cast<value_type&>(v)));
121 }
122 BOOST_CATCH(...){
123 final().deallocate_node(x);
124 BOOST_RETHROW;
125 }
126 BOOST_CATCH_END
127 return x;
128 }
129
130 final_node_type* insert_(const value_type&,final_node_type*& x,emplaced_tag)
131 {
132 return x;
133 }
134
135 final_node_type* insert_(
136 const value_type& v,node_type*,final_node_type*& x,lvalue_tag)
137 {
138 return insert_(v,x,lvalue_tag());
139 }
140
141 final_node_type* insert_(
142 const value_type& v,node_type*,final_node_type*& x,rvalue_tag)
143 {
144 return insert_(v,x,rvalue_tag());
145 }
146
147 final_node_type* insert_(
148 const value_type&,node_type*,final_node_type*& x,emplaced_tag)
149 {
150 return x;
151 }
152
153 void erase_(node_type* x)
154 {
155 final().destroy_value(static_cast<final_node_type*>(x));
156 }
157
158 void delete_node_(node_type* x)
159 {
160 final().destroy_value(static_cast<final_node_type*>(x));
161 }
162
163 void clear_(){}
164
165 template<typename BoolConstant>
166 void swap_(
167 index_base<Value,IndexSpecifierList,Allocator>&,
168 BoolConstant /* swap_allocators */)
169 {}
170
171 void swap_elements_(index_base<Value,IndexSpecifierList,Allocator>&){}
172
173 bool replace_(const value_type& v,node_type* x,lvalue_tag)
174 {
175 x->value()=v;
176 return true;
177 }
178
179 bool replace_(const value_type& v,node_type* x,rvalue_tag)
180 {
181 x->value()=boost::move(const_cast<value_type&>(v));
182 return true;
183 }
184
185 bool modify_(node_type*){return true;}
186
187 bool modify_rollback_(node_type*){return true;}
188
189 bool check_rollback_(node_type*)const{return true;}
190
191 #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION)
192 /* serialization */
193
194 template<typename Archive>
195 void save_(Archive&,const unsigned int,const index_saver_type&)const{}
196
197 template<typename Archive>
198 void load_(Archive&,const unsigned int,const index_loader_type&){}
199 #endif
200
201 #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING)
202 /* invariant stuff */
203
204 bool invariant_()const{return true;}
205 #endif
206
207 /* access to backbone memfuns of Final class */
208
209 final_type& final(){return *static_cast<final_type*>(this);}
210 const final_type& final()const{return *static_cast<const final_type*>(this);}
211
212 final_node_type* final_header()const{return final().header();}
213
214 bool final_empty_()const{return final().empty_();}
215 size_type final_size_()const{return final().size_();}
216 size_type final_max_size_()const{return final().max_size_();}
217
218 std::pair<final_node_type*,bool> final_insert_(const value_type& x)
219 {return final().insert_(x);}
220 std::pair<final_node_type*,bool> final_insert_rv_(const value_type& x)
221 {return final().insert_rv_(x);}
222 template<typename T>
223 std::pair<final_node_type*,bool> final_insert_ref_(const T& t)
224 {return final().insert_ref_(t);}
225 template<typename T>
226 std::pair<final_node_type*,bool> final_insert_ref_(T& t)
227 {return final().insert_ref_(t);}
228
229 template<BOOST_MULTI_INDEX_TEMPLATE_PARAM_PACK>
230 std::pair<final_node_type*,bool> final_emplace_(
231 BOOST_MULTI_INDEX_FUNCTION_PARAM_PACK)
232 {
233 return final().emplace_(BOOST_MULTI_INDEX_FORWARD_PARAM_PACK);
234 }
235
236 std::pair<final_node_type*,bool> final_insert_(
237 const value_type& x,final_node_type* position)
238 {return final().insert_(x,position);}
239 std::pair<final_node_type*,bool> final_insert_rv_(
240 const value_type& x,final_node_type* position)
241 {return final().insert_rv_(x,position);}
242 template<typename T>
243 std::pair<final_node_type*,bool> final_insert_ref_(
244 const T& t,final_node_type* position)
245 {return final().insert_ref_(t,position);}
246 template<typename T>
247 std::pair<final_node_type*,bool> final_insert_ref_(
248 T& t,final_node_type* position)
249 {return final().insert_ref_(t,position);}
250
251 template<BOOST_MULTI_INDEX_TEMPLATE_PARAM_PACK>
252 std::pair<final_node_type*,bool> final_emplace_hint_(
253 final_node_type* position,BOOST_MULTI_INDEX_FUNCTION_PARAM_PACK)
254 {
255 return final().emplace_hint_(
256 position,BOOST_MULTI_INDEX_FORWARD_PARAM_PACK);
257 }
258
259 void final_erase_(final_node_type* x){final().erase_(x);}
260
261 void final_delete_node_(final_node_type* x){final().delete_node_(x);}
262 void final_delete_all_nodes_(){final().delete_all_nodes_();}
263 void final_clear_(){final().clear_();}
264
265 void final_swap_(final_type& x){final().swap_(x);}
266
267 bool final_replace_(
268 const value_type& k,final_node_type* x)
269 {return final().replace_(k,x);}
270 bool final_replace_rv_(
271 const value_type& k,final_node_type* x)
272 {return final().replace_rv_(k,x);}
273
274 template<typename Modifier>
275 bool final_modify_(Modifier& mod,final_node_type* x)
276 {return final().modify_(mod,x);}
277
278 template<typename Modifier,typename Rollback>
279 bool final_modify_(Modifier& mod,Rollback& back,final_node_type* x)
280 {return final().modify_(mod,back,x);}
281
282 #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING)
283 void final_check_invariant_()const{final().check_invariant_();}
284 #endif
285 };
286
287 } /* namespace multi_index::detail */
288
289 } /* namespace multi_index */
290
291 } /* namespace boost */
292
293 #endif