1 //
2 // MessagePack for C++ static resolution routine
3 //
4 // Copyright (C) 2014-2015 KONDO Takatoshi
5 //
6 //    Distributed under the Boost Software License, Version 1.0.
7 //    (See accompanying file LICENSE_1_0.txt or copy at
8 //    http://www.boost.org/LICENSE_1_0.txt)
9 //
10 #ifndef MSGPACK_V1_TYPE_CPP11_UNORDERED_SET_HPP
11 #define MSGPACK_V1_TYPE_CPP11_UNORDERED_SET_HPP
12 
13 #include "msgpack/versioning.hpp"
14 #include "msgpack/adaptor/adaptor_base.hpp"
15 #include "msgpack/adaptor/check_container_size.hpp"
16 
17 #include <unordered_set>
18 
19 namespace msgpack {
20 
21 /// @cond
MSGPACK_API_VERSION_NAMESPACE(v1)22 MSGPACK_API_VERSION_NAMESPACE(v1) {
23 /// @endcond
24 
25 namespace adaptor {
26 
27 template <typename Key, typename Hash, typename Compare, typename Alloc>
28 struct as<std::unordered_set<Key, Hash, Compare, Alloc>, typename std::enable_if<msgpack::has_as<Key>::value>::type> {
29     std::unordered_set<Key, Hash, Compare, Alloc> operator()(msgpack::object const& o) const {
30         if (o.type != msgpack::type::ARRAY) { throw msgpack::type_error(); }
31         msgpack::object* p = o.via.array.ptr + o.via.array.size;
32         msgpack::object* const pbegin = o.via.array.ptr;
33         std::unordered_set<Key, Hash, Compare, Alloc> v;
34         while (p > pbegin) {
35             --p;
36             v.insert(p->as<Key>());
37         }
38         return v;
39     }
40 };
41 
42 template <typename Key, typename Hash, typename Compare, typename Alloc>
43 struct convert<std::unordered_set<Key, Hash, Compare, Alloc>> {
44     msgpack::object const& operator()(msgpack::object const& o, std::unordered_set<Key, Hash, Compare, Alloc>& v) const {
45         if(o.type != msgpack::type::ARRAY) { throw msgpack::type_error(); }
46         msgpack::object* p = o.via.array.ptr + o.via.array.size;
47         msgpack::object* const pbegin = o.via.array.ptr;
48         std::unordered_set<Key, Hash, Compare, Alloc> tmp;
49         while(p > pbegin) {
50             --p;
51             tmp.insert(p->as<Key>());
52         }
53         v = std::move(tmp);
54         return o;
55     }
56 };
57 
58 template <typename Key, typename Hash, typename Compare, typename Alloc>
59 struct pack<std::unordered_set<Key, Hash, Compare, Alloc>> {
60     template <typename Stream>
61         msgpack::packer<Stream>& operator()(msgpack::packer<Stream>& o, const std::unordered_set<Key, Hash, Compare, Alloc>& v) const {
62         uint32_t size = checked_get_container_size(v.size());
63         o.pack_array(size);
64         for(typename std::unordered_set<Key, Hash, Compare, Alloc>::const_iterator it(v.begin()), it_end(v.end());
65             it != it_end; ++it) {
66             o.pack(*it);
67         }
68         return o;
69     }
70 };
71 
72 template <typename Key, typename Hash, typename Compare, typename Alloc>
73 struct object_with_zone<std::unordered_set<Key, Hash, Compare, Alloc>> {
74     void operator()(msgpack::object::with_zone& o, const std::unordered_set<Key, Hash, Compare, Alloc>& v) const {
75         o.type = msgpack::type::ARRAY;
76         if(v.empty()) {
77             o.via.array.ptr = MSGPACK_NULLPTR;
78             o.via.array.size = 0;
79         } else {
80             uint32_t size = checked_get_container_size(v.size());
81             msgpack::object* p = static_cast<msgpack::object*>(o.zone.allocate_align(sizeof(msgpack::object)*size, MSGPACK_ZONE_ALIGNOF(msgpack::object)));
82             msgpack::object* const pend = p + size;
83             o.via.array.ptr = p;
84             o.via.array.size = size;
85             typename std::unordered_set<Key, Hash, Compare, Alloc>::const_iterator it(v.begin());
86             do {
87                 *p = msgpack::object(*it, o.zone);
88                 ++p;
89                 ++it;
90             } while(p < pend);
91         }
92     }
93 };
94 
95 
96 template <typename Key, typename Hash, typename Compare, typename Alloc>
97 struct as<std::unordered_multiset<Key, Hash, Compare, Alloc>, typename std::enable_if<msgpack::has_as<Key>::value>::type> {
98     std::unordered_multiset<Key, Hash, Compare, Alloc> operator()(msgpack::object const& o) const {
99         if (o.type != msgpack::type::ARRAY) { throw msgpack::type_error(); }
100         msgpack::object* p = o.via.array.ptr + o.via.array.size;
101         msgpack::object* const pbegin = o.via.array.ptr;
102         std::unordered_multiset<Key, Hash, Compare, Alloc> v;
103         while (p > pbegin) {
104             --p;
105             v.insert(p->as<Key>());
106         }
107         return v;
108     }
109 };
110 
111 template <typename Key, typename Hash, typename Compare, typename Alloc>
112 struct convert<std::unordered_multiset<Key, Hash, Compare, Alloc>> {
113     msgpack::object const& operator()(msgpack::object const& o, std::unordered_multiset<Key, Hash, Compare, Alloc>& v) const {
114         if(o.type != msgpack::type::ARRAY) { throw msgpack::type_error(); }
115         msgpack::object* p = o.via.array.ptr + o.via.array.size;
116         msgpack::object* const pbegin = o.via.array.ptr;
117         std::unordered_multiset<Key, Hash, Compare, Alloc> tmp;
118         while(p > pbegin) {
119             --p;
120             tmp.insert(p->as<Key>());
121         }
122         v = std::move(tmp);
123         return o;
124     }
125 };
126 
127 template <typename Key, typename Hash, typename Compare, typename Alloc>
128 struct pack<std::unordered_multiset<Key, Hash, Compare, Alloc>> {
129     template <typename Stream>
130         msgpack::packer<Stream>& operator()(msgpack::packer<Stream>& o, const std::unordered_multiset<Key, Hash, Compare, Alloc>& v) const {
131         uint32_t size = checked_get_container_size(v.size());
132         o.pack_array(size);
133         for(typename std::unordered_multiset<Key, Hash, Compare, Alloc>::const_iterator it(v.begin()), it_end(v.end());
134             it != it_end; ++it) {
135             o.pack(*it);
136         }
137         return o;
138     }
139 };
140 
141 template <typename Key, typename Hash, typename Compare, typename Alloc>
142 struct object_with_zone<std::unordered_multiset<Key, Hash, Compare, Alloc>> {
143     void operator()(msgpack::object::with_zone& o, const std::unordered_multiset<Key, Hash, Compare, Alloc>& v) const {
144         o.type = msgpack::type::ARRAY;
145         if(v.empty()) {
146             o.via.array.ptr = MSGPACK_NULLPTR;
147             o.via.array.size = 0;
148         } else {
149             uint32_t size = checked_get_container_size(v.size());
150             msgpack::object* p = static_cast<msgpack::object*>(o.zone.allocate_align(sizeof(msgpack::object)*size, MSGPACK_ZONE_ALIGNOF(msgpack::object)));
151             msgpack::object* const pend = p + size;
152             o.via.array.ptr = p;
153             o.via.array.size = size;
154             typename std::unordered_multiset<Key, Hash, Compare, Alloc>::const_iterator it(v.begin());
155             do {
156                 *p = msgpack::object(*it, o.zone);
157                 ++p;
158                 ++it;
159             } while(p < pend);
160         }
161     }
162 };
163 
164 } // namespace adaptor
165 
166 /// @cond
167 } // MSGPACK_API_VERSION_NAMESPACE(v1)
168 /// @endcond
169 
170 } // namespace msgpack
171 
172 #endif // MSGPACK_V1_TYPE_CPP11_UNORDERED_SET_HPP
173