// // MessagePack for C++ static resolution routine // // Copyright (C) 2008-2015 FURUHASHI Sadayuki // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // http://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. // #ifndef MSGPACK_TYPE_MAP_HPP #define MSGPACK_TYPE_MAP_HPP #include "msgpack/versioning.hpp" #include "msgpack/object_fwd.hpp" #include "msgpack/adaptor/check_container_size.hpp" #include #include #include namespace msgpack { MSGPACK_API_VERSION_NAMESPACE(v1) { namespace type { template class assoc_vector : public std::vector< std::pair > {}; namespace detail { template struct pair_first_less { bool operator() (const std::pair& x, const std::pair& y) const { return x.first < y.first; } }; } } //namespace type template inline msgpack::object const& operator>> (msgpack::object const& o, type::assoc_vector& v) { if(o.type != msgpack::type::MAP) { throw msgpack::type_error(); } v.resize(o.via.map.size); msgpack::object_kv* p = o.via.map.ptr; msgpack::object_kv* const pend = o.via.map.ptr + o.via.map.size; std::pair* it(&v.front()); for(; p < pend; ++p, ++it) { p->key.convert(it->first); p->val.convert(it->second); } std::sort(v.begin(), v.end(), type::detail::pair_first_less()); return o; } template inline msgpack::packer& operator<< (msgpack::packer& o, const type::assoc_vector& v) { uint32_t size = checked_get_container_size(v.size()); o.pack_map(size); for(typename type::assoc_vector::const_iterator it(v.begin()), it_end(v.end()); it != it_end; ++it) { o.pack(it->first); o.pack(it->second); } return o; } template inline void operator<< (msgpack::object::with_zone& o, const type::assoc_vector& v) { o.type = msgpack::type::MAP; if(v.empty()) { o.via.map.ptr = nullptr; o.via.map.size = 0; } else { uint32_t size = checked_get_container_size(v.size()); msgpack::object_kv* p = static_cast(o.zone.allocate_align(sizeof(msgpack::object_kv)*size)); msgpack::object_kv* const pend = p + size; o.via.map.ptr = p; o.via.map.size = size; typename type::assoc_vector::const_iterator it(v.begin()); do { p->key = msgpack::object(it->first, o.zone); p->val = msgpack::object(it->second, o.zone); ++p; ++it; } while(p < pend); } } template inline msgpack::object const& operator>> (msgpack::object const& o, std::map& v) { if(o.type != msgpack::type::MAP) { throw msgpack::type_error(); } msgpack::object_kv* p(o.via.map.ptr); msgpack::object_kv* const pend(o.via.map.ptr + o.via.map.size); std::map tmp; for(; p != pend; ++p) { K key; p->key.convert(key); typename std::map::iterator it(tmp.lower_bound(key)); if(it != tmp.end() && !(key < it->first)) { p->val.convert(it->second); } else { V val; p->val.convert(val); tmp.insert(it, std::pair(key, val)); } } tmp.swap(v); return o; } template inline msgpack::packer& operator<< (msgpack::packer& o, const std::map& v) { uint32_t size = checked_get_container_size(v.size()); o.pack_map(size); for(typename std::map::const_iterator it(v.begin()), it_end(v.end()); it != it_end; ++it) { o.pack(it->first); o.pack(it->second); } return o; } template inline void operator<< (msgpack::object::with_zone& o, const std::map& v) { o.type = msgpack::type::MAP; if(v.empty()) { o.via.map.ptr = nullptr; o.via.map.size = 0; } else { uint32_t size = checked_get_container_size(v.size()); msgpack::object_kv* p = static_cast(o.zone.allocate_align(sizeof(msgpack::object_kv)*size)); msgpack::object_kv* const pend = p + size; o.via.map.ptr = p; o.via.map.size = size; typename std::map::const_iterator it(v.begin()); do { p->key = msgpack::object(it->first, o.zone); p->val = msgpack::object(it->second, o.zone); ++p; ++it; } while(p < pend); } } template inline msgpack::object const& operator>> (msgpack::object const& o, std::multimap& v) { if(o.type != msgpack::type::MAP) { throw msgpack::type_error(); } msgpack::object_kv* p(o.via.map.ptr); msgpack::object_kv* const pend(o.via.map.ptr + o.via.map.size); std::multimap tmp; for(; p != pend; ++p) { std::pair value; p->key.convert(value.first); p->val.convert(value.second); tmp.insert(value); } tmp.swap(v); return o; } template inline msgpack::packer& operator<< (msgpack::packer& o, const std::multimap& v) { uint32_t size = checked_get_container_size(v.size()); o.pack_map(size); for(typename std::multimap::const_iterator it(v.begin()), it_end(v.end()); it != it_end; ++it) { o.pack(it->first); o.pack(it->second); } return o; } template inline void operator<< (msgpack::object::with_zone& o, const std::multimap& v) { o.type = msgpack::type::MAP; if(v.empty()) { o.via.map.ptr = nullptr; o.via.map.size = 0; } else { uint32_t size = checked_get_container_size(v.size()); msgpack::object_kv* p = static_cast(o.zone.allocate_align(sizeof(msgpack::object_kv)*size)); msgpack::object_kv* const pend = p + size; o.via.map.ptr = p; o.via.map.size = size; typename std::multimap::const_iterator it(v.begin()); do { p->key = msgpack::object(it->first, o.zone); p->val = msgpack::object(it->second, o.zone); ++p; ++it; } while(p < pend); } } } // MSGPACK_API_VERSION_NAMESPACE(v1) } // namespace msgpack #endif // MSGPACK_TYPE_MAP_HPP