189 lines
6.6 KiB
C++
189 lines
6.6 KiB
C++
|
//
|
||
|
|
// MessagePack for C++ static resolution routine
|
||
|
|
//
|
||
|
|
// Copyright (C) 2008-2015 FURUHASHI Sadayuki
|
||
|
|
//
|
||
|
|
// Distributed under the Boost Software License, Version 1.0.
|
||
|
|
// (See accompanying file LICENSE_1_0.txt or copy at
|
||
|
|
// http://www.boost.org/LICENSE_1_0.txt)
|
||
|
|
//
|
||
|
|
#ifndef MSGPACK_V1_TYPE_SET_HPP
|
||
|
|
#define MSGPACK_V1_TYPE_SET_HPP
|
||
|
|
|
||
|
|
#include "rpc/msgpack/versioning.hpp"
|
||
|
|
#include "rpc/msgpack/adaptor/adaptor_base.hpp"
|
||
|
|
#include "rpc/msgpack/adaptor/check_container_size.hpp"
|
||
|
|
|
||
|
|
#include <set>
|
||
|
|
|
||
|
|
namespace clmdep_msgpack {
|
||
|
|
|
||
|
|
/// @cond
|
||
|
|
MSGPACK_API_VERSION_NAMESPACE(v1) {
|
||
|
|
/// @endcond
|
||
|
|
|
||
|
|
namespace adaptor {
|
||
|
|
|
||
|
|
#if !defined(MSGPACK_USE_CPP03)
|
||
|
|
|
||
|
|
template <typename T, typename Compare, typename Alloc>
|
||
|
|
struct as<std::set<T, Compare, Alloc>, typename std::enable_if<clmdep_msgpack::has_as<T>::value>::type> {
|
||
|
|
std::set<T, Compare, Alloc> operator()(clmdep_msgpack::object const& o) const {
|
||
|
|
if (o.type != clmdep_msgpack::type::ARRAY) { throw clmdep_msgpack::type_error(); }
|
||
|
|
clmdep_msgpack::object* p = o.via.array.ptr + o.via.array.size;
|
||
|
|
clmdep_msgpack::object* const pbegin = o.via.array.ptr;
|
||
|
|
std::set<T, Compare, Alloc> v;
|
||
|
|
while (p > pbegin) {
|
||
|
|
--p;
|
||
|
|
v.insert(p->as<T>());
|
||
|
|
}
|
||
|
|
return v;
|
||
|
|
}
|
||
|
|
};
|
||
|
|
|
||
|
|
#endif // !defined(MSGPACK_USE_CPP03)
|
||
|
|
|
||
|
|
template <typename T, typename Compare, typename Alloc>
|
||
|
|
struct convert<std::set<T, Compare, Alloc> > {
|
||
|
|
clmdep_msgpack::object const& operator()(clmdep_msgpack::object const& o, std::set<T, Compare, Alloc>& v) const {
|
||
|
|
if (o.type != clmdep_msgpack::type::ARRAY) { throw clmdep_msgpack::type_error(); }
|
||
|
|
clmdep_msgpack::object* p = o.via.array.ptr + o.via.array.size;
|
||
|
|
clmdep_msgpack::object* const pbegin = o.via.array.ptr;
|
||
|
|
std::set<T, Compare, Alloc> tmp;
|
||
|
|
while (p > pbegin) {
|
||
|
|
--p;
|
||
|
|
tmp.insert(p->as<T>());
|
||
|
|
}
|
||
|
|
#if __cplusplus >= 201103L
|
||
|
|
v = std::move(tmp);
|
||
|
|
#else
|
||
|
|
tmp.swap(v);
|
||
|
|
#endif
|
||
|
|
return o;
|
||
|
|
}
|
||
|
|
};
|
||
|
|
|
||
|
|
template <typename T, typename Compare, typename Alloc>
|
||
|
|
struct pack<std::set<T, Compare, Alloc> > {
|
||
|
|
template <typename Stream>
|
||
|
|
clmdep_msgpack::packer<Stream>& operator()(clmdep_msgpack::packer<Stream>& o, const std::set<T, Compare, Alloc>& v) const {
|
||
|
|
uint32_t size = checked_get_container_size(v.size());
|
||
|
|
o.pack_array(size);
|
||
|
|
for (typename std::set<T, Compare, Alloc>::const_iterator it(v.begin()), it_end(v.end());
|
||
|
|
it != it_end; ++it) {
|
||
|
|
o.pack(*it);
|
||
|
|
}
|
||
|
|
return o;
|
||
|
|
}
|
||
|
|
};
|
||
|
|
|
||
|
|
template <typename T, typename Compare, typename Alloc>
|
||
|
|
struct object_with_zone<std::set<T, Compare, Alloc> > {
|
||
|
|
void operator()(clmdep_msgpack::object::with_zone& o, const std::set<T, Compare, Alloc>& v) const {
|
||
|
|
o.type = clmdep_msgpack::type::ARRAY;
|
||
|
|
if (v.empty()) {
|
||
|
|
o.via.array.ptr = MSGPACK_NULLPTR;
|
||
|
|
o.via.array.size = 0;
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
uint32_t size = checked_get_container_size(v.size());
|
||
|
|
clmdep_msgpack::object* p = static_cast<clmdep_msgpack::object*>(o.zone.allocate_align(sizeof(clmdep_msgpack::object)*size, MSGPACK_ZONE_ALIGNOF(clmdep_msgpack::object)));
|
||
|
|
clmdep_msgpack::object* const pend = p + size;
|
||
|
|
o.via.array.ptr = p;
|
||
|
|
o.via.array.size = size;
|
||
|
|
typename std::set<T, Compare, Alloc>::const_iterator it(v.begin());
|
||
|
|
do {
|
||
|
|
*p = clmdep_msgpack::object(*it, o.zone);
|
||
|
|
++p;
|
||
|
|
++it;
|
||
|
|
} while(p < pend);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
};
|
||
|
|
|
||
|
|
#if !defined(MSGPACK_USE_CPP03)
|
||
|
|
|
||
|
|
template <typename T, typename Compare, typename Alloc>
|
||
|
|
struct as<std::multiset<T, Compare, Alloc>, typename std::enable_if<clmdep_msgpack::has_as<T>::value>::type> {
|
||
|
|
std::multiset<T, Compare, Alloc> operator()(clmdep_msgpack::object const& o) const {
|
||
|
|
if (o.type != clmdep_msgpack::type::ARRAY) { throw clmdep_msgpack::type_error(); }
|
||
|
|
clmdep_msgpack::object* p = o.via.array.ptr + o.via.array.size;
|
||
|
|
clmdep_msgpack::object* const pbegin = o.via.array.ptr;
|
||
|
|
std::multiset<T, Compare, Alloc> v;
|
||
|
|
while (p > pbegin) {
|
||
|
|
--p;
|
||
|
|
v.insert(p->as<T>());
|
||
|
|
}
|
||
|
|
return v;
|
||
|
|
}
|
||
|
|
};
|
||
|
|
|
||
|
|
#endif // !defined(MSGPACK_USE_CPP03)
|
||
|
|
|
||
|
|
template <typename T, typename Compare, typename Alloc>
|
||
|
|
struct convert<std::multiset<T, Compare, Alloc> > {
|
||
|
|
clmdep_msgpack::object const& operator()(clmdep_msgpack::object const& o, std::multiset<T, Compare, Alloc>& v) const {
|
||
|
|
if (o.type != clmdep_msgpack::type::ARRAY) { throw clmdep_msgpack::type_error(); }
|
||
|
|
clmdep_msgpack::object* p = o.via.array.ptr + o.via.array.size;
|
||
|
|
clmdep_msgpack::object* const pbegin = o.via.array.ptr;
|
||
|
|
std::multiset<T, Compare, Alloc> tmp;
|
||
|
|
while (p > pbegin) {
|
||
|
|
--p;
|
||
|
|
tmp.insert(p->as<T>());
|
||
|
|
}
|
||
|
|
#if __cplusplus >= 201103L
|
||
|
|
v = std::move(tmp);
|
||
|
|
#else
|
||
|
|
tmp.swap(v);
|
||
|
|
#endif
|
||
|
|
return o;
|
||
|
|
}
|
||
|
|
};
|
||
|
|
|
||
|
|
template <typename T, typename Compare, typename Alloc>
|
||
|
|
struct pack<std::multiset<T, Compare, Alloc> > {
|
||
|
|
template <typename Stream>
|
||
|
|
clmdep_msgpack::packer<Stream>& operator()(clmdep_msgpack::packer<Stream>& o, const std::multiset<T, Compare, Alloc>& v) const {
|
||
|
|
uint32_t size = checked_get_container_size(v.size());
|
||
|
|
o.pack_array(size);
|
||
|
|
for (typename std::multiset<T, Compare, Alloc>::const_iterator it(v.begin()), it_end(v.end());
|
||
|
|
it != it_end; ++it) {
|
||
|
|
o.pack(*it);
|
||
|
|
}
|
||
|
|
return o;
|
||
|
|
}
|
||
|
|
};
|
||
|
|
|
||
|
|
template <typename T, typename Compare, typename Alloc>
|
||
|
|
struct object_with_zone<std::multiset<T, Compare, Alloc> > {
|
||
|
|
void operator()(clmdep_msgpack::object::with_zone& o, const std::multiset<T, Compare, Alloc>& v) const {
|
||
|
|
o.type = clmdep_msgpack::type::ARRAY;
|
||
|
|
if (v.empty()) {
|
||
|
|
o.via.array.ptr = MSGPACK_NULLPTR;
|
||
|
|
o.via.array.size = 0;
|
||
|
|
} else {
|
||
|
|
uint32_t size = checked_get_container_size(v.size());
|
||
|
|
clmdep_msgpack::object* p = static_cast<clmdep_msgpack::object*>(o.zone.allocate_align(sizeof(clmdep_msgpack::object)*size, MSGPACK_ZONE_ALIGNOF(clmdep_msgpack::object)));
|
||
|
|
clmdep_msgpack::object* const pend = p + size;
|
||
|
|
o.via.array.ptr = p;
|
||
|
|
o.via.array.size = size;
|
||
|
|
typename std::multiset<T, Compare, Alloc>::const_iterator it(v.begin());
|
||
|
|
do {
|
||
|
|
*p = clmdep_msgpack::object(*it, o.zone);
|
||
|
|
++p;
|
||
|
|
++it;
|
||
|
|
} while(p < pend);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
};
|
||
|
|
|
||
|
|
} // namespace adaptor
|
||
|
|
|
||
|
|
/// @cond
|
||
|
|
} // MSGPACK_API_VERSION_NAMESPACE(v1)
|
||
|
|
/// @endcond
|
||
|
|
|
||
|
|
} // namespace clmdep_msgpack
|
||
|
|
|
||
|
|
#endif // MSGPACK_V1_TYPE_SET_HPP
|