Chris@16
|
1 // Boost.Bimap
|
Chris@16
|
2 //
|
Chris@16
|
3 // Copyright (c) 2006-2007 Matias Capeletto
|
Chris@16
|
4 //
|
Chris@16
|
5 // Distributed under the Boost Software License, Version 1.0.
|
Chris@16
|
6 // (See accompanying file LICENSE_1_0.txt or copy at
|
Chris@16
|
7 // http://www.boost.org/LICENSE_1_0.txt)
|
Chris@16
|
8
|
Chris@16
|
9 /// \file unordered_multiset_of.hpp
|
Chris@16
|
10 /// \brief Include support for unordered_multiset constrains for the bimap container
|
Chris@16
|
11
|
Chris@16
|
12 #ifndef BOOST_BIMAP_UNORDERED_MULTISET_OF_HPP
|
Chris@16
|
13 #define BOOST_BIMAP_UNORDERED_MULTISET_OF_HPP
|
Chris@16
|
14
|
Chris@101
|
15 #if defined(_MSC_VER)
|
Chris@16
|
16 #pragma once
|
Chris@16
|
17 #endif
|
Chris@16
|
18
|
Chris@16
|
19 #include <boost/config.hpp>
|
Chris@16
|
20
|
Chris@16
|
21 #include <boost/bimap/detail/user_interface_config.hpp>
|
Chris@16
|
22
|
Chris@16
|
23 #include <cstdlib>
|
Chris@16
|
24 #include <functional>
|
Chris@16
|
25 #include <boost/functional/hash.hpp>
|
Chris@16
|
26 #include <boost/mpl/bool.hpp>
|
Chris@16
|
27
|
Chris@16
|
28 #include <boost/concept_check.hpp>
|
Chris@16
|
29
|
Chris@16
|
30 #include <boost/bimap/detail/concept_tags.hpp>
|
Chris@16
|
31
|
Chris@16
|
32 #include <boost/bimap/tags/support/value_type_of.hpp>
|
Chris@16
|
33
|
Chris@16
|
34 #include <boost/bimap/detail/generate_index_binder.hpp>
|
Chris@16
|
35 #include <boost/bimap/detail/generate_view_binder.hpp>
|
Chris@16
|
36 #include <boost/bimap/detail/generate_relation_binder.hpp>
|
Chris@16
|
37
|
Chris@16
|
38 #include <boost/multi_index/hashed_index.hpp>
|
Chris@16
|
39
|
Chris@16
|
40 #include <boost/bimap/views/unordered_multimap_view.hpp>
|
Chris@16
|
41 #include <boost/bimap/views/unordered_multiset_view.hpp>
|
Chris@16
|
42
|
Chris@16
|
43 namespace boost {
|
Chris@16
|
44 namespace bimaps {
|
Chris@16
|
45
|
Chris@16
|
46
|
Chris@16
|
47 /// \brief Set Type Specification
|
Chris@16
|
48 /**
|
Chris@16
|
49 This struct is used to specify an unordered_multiset specification.
|
Chris@16
|
50 It is not a container, it is just a metaprogramming facility to
|
Chris@16
|
51 express the type of a set. Generally, this specification will
|
Chris@16
|
52 be used in other place to create a container.
|
Chris@16
|
53 It has the same syntax that an tr1::unordered_multiset instantiation,
|
Chris@16
|
54 except that the allocator cannot be specified. The rationale behind
|
Chris@16
|
55 this difference is that the allocator is not part of the
|
Chris@16
|
56 unordered_multiset type specification, rather it is a container
|
Chris@16
|
57 configuration parameter.
|
Chris@16
|
58 The first parameter is the type of the objects in the set, the
|
Chris@16
|
59 second one is a Hash Functor that takes objects of this type, and
|
Chris@16
|
60 the third one is a Functor that compares them for equality.
|
Chris@16
|
61 Bimap binding metafunctions can be used with this class in
|
Chris@16
|
62 the following way:
|
Chris@16
|
63
|
Chris@16
|
64 \code
|
Chris@16
|
65 using namespace support;
|
Chris@16
|
66
|
Chris@16
|
67 BOOST_STATIC_ASSERT( is_set_type_of< unordered_multiset_of<Type> >::value )
|
Chris@16
|
68
|
Chris@16
|
69 BOOST_STATIC_ASSERT
|
Chris@16
|
70 (
|
Chris@16
|
71 is_same
|
Chris@16
|
72 <
|
Chris@16
|
73 compute_index_type
|
Chris@16
|
74 <
|
Chris@16
|
75 unordered_multiset_of<Type,HashFunctor,EqualKey>,
|
Chris@16
|
76 KeyExtractor,
|
Chris@16
|
77 Tag
|
Chris@16
|
78
|
Chris@16
|
79 >::type
|
Chris@16
|
80 ,
|
Chris@16
|
81 hashed_nonunique< tag<Tag>, KeyExtractor, HashFunctor, EqualKey >
|
Chris@16
|
82
|
Chris@16
|
83 >::value
|
Chris@16
|
84 )
|
Chris@16
|
85
|
Chris@16
|
86 typedef bimap
|
Chris@16
|
87 <
|
Chris@16
|
88 unordered_multiset_of<Type>, RightKeyType
|
Chris@16
|
89
|
Chris@16
|
90 > bimap_with_left_type_as_unordered_multiset;
|
Chris@16
|
91
|
Chris@16
|
92 BOOST_STATIC_ASSERT
|
Chris@16
|
93 (
|
Chris@16
|
94 is_same
|
Chris@16
|
95 <
|
Chris@16
|
96 compute_map_view_type
|
Chris@16
|
97 <
|
Chris@16
|
98 member_at::left,
|
Chris@16
|
99 bimap_with_left_type_as_unordered_multiset
|
Chris@16
|
100
|
Chris@16
|
101 >::type,
|
Chris@16
|
102
|
Chris@16
|
103 unordered_multimap_view
|
Chris@16
|
104 <
|
Chris@16
|
105 member_at::left,
|
Chris@16
|
106 bimap_with_left_type_as_unordered_multiset
|
Chris@16
|
107 >
|
Chris@16
|
108
|
Chris@16
|
109 >::value
|
Chris@16
|
110 )
|
Chris@16
|
111
|
Chris@16
|
112 \endcode
|
Chris@16
|
113
|
Chris@16
|
114 See also unordered_multiset_of_relation.
|
Chris@16
|
115 **/
|
Chris@16
|
116
|
Chris@16
|
117 template
|
Chris@16
|
118 <
|
Chris@16
|
119 class KeyType,
|
Chris@16
|
120 class HashFunctor = hash< BOOST_DEDUCED_TYPENAME
|
Chris@16
|
121 ::boost::bimaps::tags::support::value_type_of<KeyType>::type >,
|
Chris@16
|
122 class EqualKey = std::equal_to< BOOST_DEDUCED_TYPENAME
|
Chris@16
|
123 ::boost::bimaps::tags::support::value_type_of<KeyType>::type >
|
Chris@16
|
124 >
|
Chris@16
|
125 struct unordered_multiset_of : public ::boost::bimaps::detail::set_type_of_tag
|
Chris@16
|
126 {
|
Chris@16
|
127 /// User type, can be tagged
|
Chris@16
|
128 typedef KeyType user_type;
|
Chris@16
|
129
|
Chris@16
|
130 /// Type of the object that will be stored in the container
|
Chris@16
|
131 typedef BOOST_DEDUCED_TYPENAME ::boost::bimaps::tags::support::
|
Chris@16
|
132 value_type_of<user_type>::type value_type;
|
Chris@16
|
133
|
Chris@16
|
134 /// Hash Functor that takes value_type objects
|
Chris@16
|
135 typedef HashFunctor hasher;
|
Chris@16
|
136
|
Chris@16
|
137 /// Functor that compare two value_type objects for equality
|
Chris@16
|
138 typedef EqualKey key_equal;
|
Chris@16
|
139
|
Chris@16
|
140 struct lazy_concept_checked
|
Chris@16
|
141 {
|
Chris@16
|
142 BOOST_CLASS_REQUIRE ( value_type,
|
Chris@16
|
143 boost, AssignableConcept );
|
Chris@16
|
144
|
Chris@16
|
145 BOOST_CLASS_REQUIRE3( hasher, std::size_t, value_type,
|
Chris@16
|
146 boost, UnaryFunctionConcept );
|
Chris@16
|
147
|
Chris@16
|
148 BOOST_CLASS_REQUIRE4( key_equal, bool, value_type, value_type,
|
Chris@16
|
149 boost, BinaryFunctionConcept );
|
Chris@16
|
150
|
Chris@16
|
151 typedef unordered_multiset_of type;
|
Chris@16
|
152 };
|
Chris@16
|
153
|
Chris@16
|
154 BOOST_BIMAP_GENERATE_INDEX_BINDER_2CP(
|
Chris@16
|
155
|
Chris@16
|
156 // binds to
|
Chris@16
|
157 multi_index::hashed_non_unique,
|
Chris@16
|
158
|
Chris@16
|
159 // with
|
Chris@16
|
160 hasher,
|
Chris@16
|
161 key_equal
|
Chris@16
|
162 )
|
Chris@16
|
163
|
Chris@16
|
164 BOOST_BIMAP_GENERATE_MAP_VIEW_BINDER(
|
Chris@16
|
165
|
Chris@16
|
166 // binds to
|
Chris@16
|
167 views::unordered_multimap_view
|
Chris@16
|
168 )
|
Chris@16
|
169
|
Chris@16
|
170 BOOST_BIMAP_GENERATE_SET_VIEW_BINDER(
|
Chris@16
|
171
|
Chris@16
|
172 // binds to
|
Chris@16
|
173 views::unordered_multiset_view
|
Chris@16
|
174 )
|
Chris@16
|
175
|
Chris@16
|
176 typedef mpl::bool_<false> mutable_key;
|
Chris@16
|
177 };
|
Chris@16
|
178
|
Chris@16
|
179
|
Chris@16
|
180 /// \brief Set Of Relation Specification
|
Chris@16
|
181 /**
|
Chris@16
|
182 This struct is similar to unordered_multiset_of but it is bind logically
|
Chris@16
|
183 to a relation. It is used in the bimap instantiation to specify the
|
Chris@16
|
184 desired type of the main view. This struct implements internally
|
Chris@16
|
185 a metafunction named bind_to that manages the quite complicated
|
Chris@16
|
186 task of finding the right type of the set for the relation.
|
Chris@16
|
187
|
Chris@16
|
188 \code
|
Chris@16
|
189 template<class Relation>
|
Chris@16
|
190 struct bind_to
|
Chris@16
|
191 {
|
Chris@16
|
192 typedef -unspecified- type;
|
Chris@16
|
193 };
|
Chris@16
|
194 \endcode
|
Chris@16
|
195
|
Chris@16
|
196 See also unordered_multiset_of, is_set_type_of_relation.
|
Chris@16
|
197 **/
|
Chris@16
|
198
|
Chris@16
|
199 template
|
Chris@16
|
200 <
|
Chris@16
|
201 class HashFunctor = hash< _relation >,
|
Chris@16
|
202 class EqualKey = std::equal_to< _relation >
|
Chris@16
|
203 >
|
Chris@16
|
204 struct unordered_multiset_of_relation : public ::boost::bimaps::detail::set_type_of_relation_tag
|
Chris@16
|
205 {
|
Chris@16
|
206 /// Hash Functor that takes value_type objects
|
Chris@16
|
207 typedef HashFunctor hasher;
|
Chris@16
|
208
|
Chris@16
|
209 /// Functor that compare two value_type objects for equality
|
Chris@16
|
210 typedef EqualKey key_equal;
|
Chris@16
|
211
|
Chris@16
|
212
|
Chris@16
|
213 BOOST_BIMAP_GENERATE_RELATION_BINDER_2CP(
|
Chris@16
|
214
|
Chris@16
|
215 // binds to
|
Chris@16
|
216 unordered_multiset_of,
|
Chris@16
|
217
|
Chris@16
|
218 // with
|
Chris@16
|
219 hasher,
|
Chris@16
|
220 key_equal
|
Chris@16
|
221 )
|
Chris@16
|
222
|
Chris@16
|
223 typedef mpl::bool_<false> left_mutable_key;
|
Chris@16
|
224 typedef mpl::bool_<false> right_mutable_key;
|
Chris@16
|
225 };
|
Chris@16
|
226
|
Chris@16
|
227
|
Chris@16
|
228 } // namespace bimaps
|
Chris@16
|
229 } // namespace boost
|
Chris@16
|
230
|
Chris@16
|
231
|
Chris@16
|
232 #endif // BOOST_BIMAP_UNORDERED_MULTISET_OF_HPP
|
Chris@16
|
233
|