Chris@16
|
1 /////////////////////////////////////////////////////////////////////////////
|
Chris@16
|
2 //
|
Chris@16
|
3 // (C) Copyright Olaf Krzikalla 2004-2006.
|
Chris@16
|
4 // (C) Copyright Ion Gaztanaga 2006-2013
|
Chris@16
|
5 //
|
Chris@16
|
6 // Distributed under the Boost Software License, Version 1.0.
|
Chris@16
|
7 // (See accompanying file LICENSE_1_0.txt or copy at
|
Chris@16
|
8 // http://www.boost.org/LICENSE_1_0.txt)
|
Chris@16
|
9 //
|
Chris@16
|
10 // See http://www.boost.org/libs/intrusive for documentation.
|
Chris@16
|
11 //
|
Chris@16
|
12 /////////////////////////////////////////////////////////////////////////////
|
Chris@16
|
13
|
Chris@16
|
14 #ifndef BOOST_INTRUSIVE_SET_HOOK_HPP
|
Chris@16
|
15 #define BOOST_INTRUSIVE_SET_HOOK_HPP
|
Chris@16
|
16
|
Chris@16
|
17 #include <boost/intrusive/detail/config_begin.hpp>
|
Chris@16
|
18 #include <boost/intrusive/intrusive_fwd.hpp>
|
Chris@16
|
19 #include <boost/intrusive/detail/utilities.hpp>
|
Chris@16
|
20 #include <boost/intrusive/detail/rbtree_node.hpp>
|
Chris@16
|
21 #include <boost/intrusive/rbtree_algorithms.hpp>
|
Chris@16
|
22 #include <boost/intrusive/options.hpp>
|
Chris@16
|
23 #include <boost/intrusive/detail/generic_hook.hpp>
|
Chris@16
|
24
|
Chris@16
|
25 namespace boost {
|
Chris@16
|
26 namespace intrusive {
|
Chris@16
|
27
|
Chris@16
|
28 /// @cond
|
Chris@16
|
29 template<class VoidPointer, bool OptimizeSize = false>
|
Chris@16
|
30 struct get_set_node_algo
|
Chris@16
|
31 {
|
Chris@16
|
32 typedef rbtree_algorithms<rbtree_node_traits<VoidPointer, OptimizeSize> > type;
|
Chris@16
|
33 };
|
Chris@16
|
34 /// @endcond
|
Chris@16
|
35
|
Chris@16
|
36 //! Helper metafunction to define a \c set_base_hook that yields to the same
|
Chris@16
|
37 //! type when the same options (either explicitly or implicitly) are used.
|
Chris@16
|
38 #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
|
Chris@16
|
39 template<class ...Options>
|
Chris@16
|
40 #else
|
Chris@16
|
41 template<class O1 = void, class O2 = void, class O3 = void, class O4 = void>
|
Chris@16
|
42 #endif
|
Chris@16
|
43 struct make_set_base_hook
|
Chris@16
|
44 {
|
Chris@16
|
45 /// @cond
|
Chris@16
|
46 typedef typename pack_options
|
Chris@16
|
47 < hook_defaults,
|
Chris@16
|
48 #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
|
Chris@16
|
49 O1, O2, O3, O4
|
Chris@16
|
50 #else
|
Chris@16
|
51 Options...
|
Chris@16
|
52 #endif
|
Chris@16
|
53 >::type packed_options;
|
Chris@16
|
54
|
Chris@16
|
55 typedef generic_hook
|
Chris@16
|
56 < get_set_node_algo<typename packed_options::void_pointer
|
Chris@16
|
57 ,packed_options::optimize_size>
|
Chris@16
|
58 , typename packed_options::tag
|
Chris@16
|
59 , packed_options::link_mode
|
Chris@16
|
60 , RbTreeBaseHookId
|
Chris@16
|
61 > implementation_defined;
|
Chris@16
|
62 /// @endcond
|
Chris@16
|
63 typedef implementation_defined type;
|
Chris@16
|
64 };
|
Chris@16
|
65
|
Chris@16
|
66 //! Derive a class from set_base_hook in order to store objects in
|
Chris@16
|
67 //! in a set/multiset. set_base_hook holds the data necessary to maintain
|
Chris@16
|
68 //! the set/multiset and provides an appropriate value_traits class for set/multiset.
|
Chris@16
|
69 //!
|
Chris@16
|
70 //! The hook admits the following options: \c tag<>, \c void_pointer<>,
|
Chris@16
|
71 //! \c link_mode<> and \c optimize_size<>.
|
Chris@16
|
72 //!
|
Chris@16
|
73 //! \c tag<> defines a tag to identify the node.
|
Chris@16
|
74 //! The same tag value can be used in different classes, but if a class is
|
Chris@16
|
75 //! derived from more than one \c list_base_hook, then each \c list_base_hook needs its
|
Chris@16
|
76 //! unique tag.
|
Chris@16
|
77 //!
|
Chris@16
|
78 //! \c void_pointer<> is the pointer type that will be used internally in the hook
|
Chris@16
|
79 //! and the the container configured to use this hook.
|
Chris@16
|
80 //!
|
Chris@16
|
81 //! \c link_mode<> will specify the linking mode of the hook (\c normal_link,
|
Chris@16
|
82 //! \c auto_unlink or \c safe_link).
|
Chris@16
|
83 //!
|
Chris@16
|
84 //! \c optimize_size<> will tell the hook to optimize the hook for size instead
|
Chris@16
|
85 //! of speed.
|
Chris@16
|
86 #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
|
Chris@16
|
87 template<class ...Options>
|
Chris@16
|
88 #else
|
Chris@16
|
89 template<class O1, class O2, class O3, class O4>
|
Chris@16
|
90 #endif
|
Chris@16
|
91 class set_base_hook
|
Chris@16
|
92 : public make_set_base_hook<
|
Chris@16
|
93 #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
|
Chris@16
|
94 O1, O2, O3, O4
|
Chris@16
|
95 #else
|
Chris@16
|
96 Options...
|
Chris@16
|
97 #endif
|
Chris@16
|
98 >::type
|
Chris@16
|
99 {
|
Chris@16
|
100 #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
|
Chris@16
|
101 public:
|
Chris@16
|
102 //! <b>Effects</b>: If link_mode is \c auto_unlink or \c safe_link
|
Chris@16
|
103 //! initializes the node to an unlinked state.
|
Chris@16
|
104 //!
|
Chris@16
|
105 //! <b>Throws</b>: Nothing.
|
Chris@16
|
106 set_base_hook();
|
Chris@16
|
107
|
Chris@16
|
108 //! <b>Effects</b>: If link_mode is \c auto_unlink or \c safe_link
|
Chris@16
|
109 //! initializes the node to an unlinked state. The argument is ignored.
|
Chris@16
|
110 //!
|
Chris@16
|
111 //! <b>Throws</b>: Nothing.
|
Chris@16
|
112 //!
|
Chris@16
|
113 //! <b>Rationale</b>: Providing a copy-constructor
|
Chris@16
|
114 //! makes classes using the hook STL-compliant without forcing the
|
Chris@16
|
115 //! user to do some additional work. \c swap can be used to emulate
|
Chris@16
|
116 //! move-semantics.
|
Chris@16
|
117 set_base_hook(const set_base_hook& );
|
Chris@16
|
118
|
Chris@16
|
119 //! <b>Effects</b>: Empty function. The argument is ignored.
|
Chris@16
|
120 //!
|
Chris@16
|
121 //! <b>Throws</b>: Nothing.
|
Chris@16
|
122 //!
|
Chris@16
|
123 //! <b>Rationale</b>: Providing an assignment operator
|
Chris@16
|
124 //! makes classes using the hook STL-compliant without forcing the
|
Chris@16
|
125 //! user to do some additional work. \c swap can be used to emulate
|
Chris@16
|
126 //! move-semantics.
|
Chris@16
|
127 set_base_hook& operator=(const set_base_hook& );
|
Chris@16
|
128
|
Chris@16
|
129 //! <b>Effects</b>: If link_mode is \c normal_link, the destructor does
|
Chris@16
|
130 //! nothing (ie. no code is generated). If link_mode is \c safe_link and the
|
Chris@16
|
131 //! object is stored in a set an assertion is raised. If link_mode is
|
Chris@16
|
132 //! \c auto_unlink and \c is_linked() is true, the node is unlinked.
|
Chris@16
|
133 //!
|
Chris@16
|
134 //! <b>Throws</b>: Nothing.
|
Chris@16
|
135 ~set_base_hook();
|
Chris@16
|
136
|
Chris@16
|
137 //! <b>Effects</b>: Swapping two nodes swaps the position of the elements
|
Chris@16
|
138 //! related to those nodes in one or two containers. That is, if the node
|
Chris@16
|
139 //! this is part of the element e1, the node x is part of the element e2
|
Chris@16
|
140 //! and both elements are included in the containers s1 and s2, then after
|
Chris@16
|
141 //! the swap-operation e1 is in s2 at the position of e2 and e2 is in s1
|
Chris@16
|
142 //! at the position of e1. If one element is not in a container, then
|
Chris@16
|
143 //! after the swap-operation the other element is not in a container.
|
Chris@16
|
144 //! Iterators to e1 and e2 related to those nodes are invalidated.
|
Chris@16
|
145 //!
|
Chris@16
|
146 //! <b>Complexity</b>: Constant
|
Chris@16
|
147 //!
|
Chris@16
|
148 //! <b>Throws</b>: Nothing.
|
Chris@16
|
149 void swap_nodes(set_base_hook &other);
|
Chris@16
|
150
|
Chris@16
|
151 //! <b>Precondition</b>: link_mode must be \c safe_link or \c auto_unlink.
|
Chris@16
|
152 //!
|
Chris@16
|
153 //! <b>Returns</b>: true, if the node belongs to a container, false
|
Chris@16
|
154 //! otherwise. This function can be used to test whether \c set::iterator_to
|
Chris@16
|
155 //! will return a valid iterator.
|
Chris@16
|
156 //!
|
Chris@16
|
157 //! <b>Complexity</b>: Constant
|
Chris@16
|
158 bool is_linked() const;
|
Chris@16
|
159
|
Chris@16
|
160 //! <b>Effects</b>: Removes the node if it's inserted in a container.
|
Chris@16
|
161 //! This function is only allowed if link_mode is \c auto_unlink.
|
Chris@16
|
162 //!
|
Chris@16
|
163 //! <b>Throws</b>: Nothing.
|
Chris@16
|
164 void unlink();
|
Chris@16
|
165 #endif
|
Chris@16
|
166 };
|
Chris@16
|
167
|
Chris@16
|
168 //! Helper metafunction to define a \c set_member_hook that yields to the same
|
Chris@16
|
169 //! type when the same options (either explicitly or implicitly) are used.
|
Chris@16
|
170 #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
|
Chris@16
|
171 template<class ...Options>
|
Chris@16
|
172 #else
|
Chris@16
|
173 template<class O1 = void, class O2 = void, class O3 = void, class O4 = void>
|
Chris@16
|
174 #endif
|
Chris@16
|
175 struct make_set_member_hook
|
Chris@16
|
176 {
|
Chris@16
|
177 /// @cond
|
Chris@16
|
178 typedef typename pack_options
|
Chris@16
|
179 < hook_defaults,
|
Chris@16
|
180 #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
|
Chris@16
|
181 O1, O2, O3, O4
|
Chris@16
|
182 #else
|
Chris@16
|
183 Options...
|
Chris@16
|
184 #endif
|
Chris@16
|
185 >::type packed_options;
|
Chris@16
|
186
|
Chris@16
|
187 typedef generic_hook
|
Chris@16
|
188 < get_set_node_algo<typename packed_options::void_pointer
|
Chris@16
|
189 ,packed_options::optimize_size>
|
Chris@16
|
190 , member_tag
|
Chris@16
|
191 , packed_options::link_mode
|
Chris@16
|
192 , NoBaseHookId
|
Chris@16
|
193 > implementation_defined;
|
Chris@16
|
194 /// @endcond
|
Chris@16
|
195 typedef implementation_defined type;
|
Chris@16
|
196 };
|
Chris@16
|
197
|
Chris@16
|
198 //! Put a public data member set_member_hook in order to store objects of this class in
|
Chris@16
|
199 //! a set/multiset. set_member_hook holds the data necessary for maintaining the
|
Chris@16
|
200 //! set/multiset and provides an appropriate value_traits class for set/multiset.
|
Chris@16
|
201 //!
|
Chris@16
|
202 //! The hook admits the following options: \c void_pointer<>,
|
Chris@16
|
203 //! \c link_mode<> and \c optimize_size<>.
|
Chris@16
|
204 //!
|
Chris@16
|
205 //! \c void_pointer<> is the pointer type that will be used internally in the hook
|
Chris@16
|
206 //! and the the container configured to use this hook.
|
Chris@16
|
207 //!
|
Chris@16
|
208 //! \c link_mode<> will specify the linking mode of the hook (\c normal_link,
|
Chris@16
|
209 //! \c auto_unlink or \c safe_link).
|
Chris@16
|
210 //!
|
Chris@16
|
211 //! \c optimize_size<> will tell the hook to optimize the hook for size instead
|
Chris@16
|
212 //! of speed.
|
Chris@16
|
213 #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
|
Chris@16
|
214 template<class ...Options>
|
Chris@16
|
215 #else
|
Chris@16
|
216 template<class O1, class O2, class O3, class O4>
|
Chris@16
|
217 #endif
|
Chris@16
|
218 class set_member_hook
|
Chris@16
|
219 : public make_set_member_hook<
|
Chris@16
|
220 #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
|
Chris@16
|
221 O1, O2, O3, O4
|
Chris@16
|
222 #else
|
Chris@16
|
223 Options...
|
Chris@16
|
224 #endif
|
Chris@16
|
225 >::type
|
Chris@16
|
226 {
|
Chris@16
|
227 #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
|
Chris@16
|
228 public:
|
Chris@16
|
229 //! <b>Effects</b>: If link_mode is \c auto_unlink or \c safe_link
|
Chris@16
|
230 //! initializes the node to an unlinked state.
|
Chris@16
|
231 //!
|
Chris@16
|
232 //! <b>Throws</b>: Nothing.
|
Chris@16
|
233 set_member_hook();
|
Chris@16
|
234
|
Chris@16
|
235 //! <b>Effects</b>: If link_mode is \c auto_unlink or \c safe_link
|
Chris@16
|
236 //! initializes the node to an unlinked state. The argument is ignored.
|
Chris@16
|
237 //!
|
Chris@16
|
238 //! <b>Throws</b>: Nothing.
|
Chris@16
|
239 //!
|
Chris@16
|
240 //! <b>Rationale</b>: Providing a copy-constructor
|
Chris@16
|
241 //! makes classes using the hook STL-compliant without forcing the
|
Chris@16
|
242 //! user to do some additional work. \c swap can be used to emulate
|
Chris@16
|
243 //! move-semantics.
|
Chris@16
|
244 set_member_hook(const set_member_hook& );
|
Chris@16
|
245
|
Chris@16
|
246 //! <b>Effects</b>: Empty function. The argument is ignored.
|
Chris@16
|
247 //!
|
Chris@16
|
248 //! <b>Throws</b>: Nothing.
|
Chris@16
|
249 //!
|
Chris@16
|
250 //! <b>Rationale</b>: Providing an assignment operator
|
Chris@16
|
251 //! makes classes using the hook STL-compliant without forcing the
|
Chris@16
|
252 //! user to do some additional work. \c swap can be used to emulate
|
Chris@16
|
253 //! move-semantics.
|
Chris@16
|
254 set_member_hook& operator=(const set_member_hook& );
|
Chris@16
|
255
|
Chris@16
|
256 //! <b>Effects</b>: If link_mode is \c normal_link, the destructor does
|
Chris@16
|
257 //! nothing (ie. no code is generated). If link_mode is \c safe_link and the
|
Chris@16
|
258 //! object is stored in a set an assertion is raised. If link_mode is
|
Chris@16
|
259 //! \c auto_unlink and \c is_linked() is true, the node is unlinked.
|
Chris@16
|
260 //!
|
Chris@16
|
261 //! <b>Throws</b>: Nothing.
|
Chris@16
|
262 ~set_member_hook();
|
Chris@16
|
263
|
Chris@16
|
264 //! <b>Effects</b>: Swapping two nodes swaps the position of the elements
|
Chris@16
|
265 //! related to those nodes in one or two containers. That is, if the node
|
Chris@16
|
266 //! this is part of the element e1, the node x is part of the element e2
|
Chris@16
|
267 //! and both elements are included in the containers s1 and s2, then after
|
Chris@16
|
268 //! the swap-operation e1 is in s2 at the position of e2 and e2 is in s1
|
Chris@16
|
269 //! at the position of e1. If one element is not in a container, then
|
Chris@16
|
270 //! after the swap-operation the other element is not in a container.
|
Chris@16
|
271 //! Iterators to e1 and e2 related to those nodes are invalidated.
|
Chris@16
|
272 //!
|
Chris@16
|
273 //! <b>Complexity</b>: Constant
|
Chris@16
|
274 //!
|
Chris@16
|
275 //! <b>Throws</b>: Nothing.
|
Chris@16
|
276 void swap_nodes(set_member_hook &other);
|
Chris@16
|
277
|
Chris@16
|
278 //! <b>Precondition</b>: link_mode must be \c safe_link or \c auto_unlink.
|
Chris@16
|
279 //!
|
Chris@16
|
280 //! <b>Returns</b>: true, if the node belongs to a container, false
|
Chris@16
|
281 //! otherwise. This function can be used to test whether \c set::iterator_to
|
Chris@16
|
282 //! will return a valid iterator.
|
Chris@16
|
283 //!
|
Chris@16
|
284 //! <b>Complexity</b>: Constant
|
Chris@16
|
285 bool is_linked() const;
|
Chris@16
|
286
|
Chris@16
|
287 //! <b>Effects</b>: Removes the node if it's inserted in a container.
|
Chris@16
|
288 //! This function is only allowed if link_mode is \c auto_unlink.
|
Chris@16
|
289 //!
|
Chris@16
|
290 //! <b>Throws</b>: Nothing.
|
Chris@16
|
291 void unlink();
|
Chris@16
|
292 #endif
|
Chris@16
|
293 };
|
Chris@16
|
294
|
Chris@16
|
295 } //namespace intrusive
|
Chris@16
|
296 } //namespace boost
|
Chris@16
|
297
|
Chris@16
|
298 #include <boost/intrusive/detail/config_end.hpp>
|
Chris@16
|
299
|
Chris@16
|
300 #endif //BOOST_INTRUSIVE_SET_HOOK_HPP
|