Added adaptors for the C++11 version of unordered containers.

(Fixed https://github.com/msgpack/msgpack-c/issues/168)
2025-10-23 00:08:01 +02:00 · 2014-12-05 15:40:33 +09:00
parent c52a58b322
commit 9162610682
9 changed files with 460 additions and 4 deletions
--- a/include/msgpack/adaptor/cpp11/unordered_map.hpp
+++ b/include/msgpack/adaptor/cpp11/unordered_map.hpp
@@ -0,0 +1,137 @@
+//
+// MessagePack for C++ static resolution routine
+//
+// Copyright (C) 2014 KONDO Takatoshi
+//
+//    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_UNORDERED_MAP_HPP
+#define MSGPACK_TYPE_UNORDERED_MAP_HPP
+
+#include "msgpack/versioning.hpp"
+#include "msgpack/object_fwd.hpp"
+
+#include <unordered_map>
+
+namespace msgpack {
+
+MSGPACK_API_VERSION_NAMESPACE(v1) {
+
+template <typename K, typename V>
+inline object const& operator>> (object const& o, std::unordered_map<K, V>& v)
+{
+    if(o.type != type::MAP) { throw type_error(); }
+    object_kv* p(o.via.map.ptr);
+    object_kv* const pend(o.via.map.ptr + o.via.map.size);
+    std::unordered_map<K, V> tmp;
+    for(; p != pend; ++p) {
+        K key;
+        p->key.convert(key);
+        p->val.convert(tmp[key]);
+    }
+    tmp.swap(v);
+    return o;
+}
+
+template <typename Stream, typename K, typename V>
+inline packer<Stream>& operator<< (packer<Stream>& o, const std::unordered_map<K,V>& v)
+{
+    o.pack_map(v.size());
+    for(typename std::unordered_map<K,V>::const_iterator it(v.begin()), it_end(v.end());
+            it != it_end; ++it) {
+        o.pack(it->first);
+        o.pack(it->second);
+    }
+    return o;
+}
+
+template <typename K, typename V>
+inline void operator<< (object::with_zone& o, const std::unordered_map<K,V>& v)
+{
+    o.type = type::MAP;
+    if(v.empty()) {
+        o.via.map.ptr  = nullptr;
+        o.via.map.size = 0;
+    } else {
+        object_kv* p = static_cast<object_kv*>(o.zone.allocate_align(sizeof(object_kv)*v.size()));
+        object_kv* const pend = p + v.size();
+        o.via.map.ptr  = p;
+        o.via.map.size = v.size();
+        typename std::unordered_map<K,V>::const_iterator it(v.begin());
+        do {
+            p->key = object(it->first, o.zone);
+            p->val = object(it->second, o.zone);
+            ++p;
+            ++it;
+        } while(p < pend);
+    }
+}
+
+
+template <typename K, typename V>
+inline object const& operator>> (object const& o, std::unordered_multimap<K, V>& v)
+{
+    if(o.type != type::MAP) { throw type_error(); }
+    object_kv* p(o.via.map.ptr);
+    object_kv* const pend(o.via.map.ptr + o.via.map.size);
+    std::unordered_multimap<K, V> tmp;
+    for(; p != pend; ++p) {
+        std::pair<K, V> value;
+        p->key.convert(value.first);
+        p->val.convert(value.second);
+        tmp.insert(value);
+    }
+    tmp.swap(v);
+    return o;
+}
+
+template <typename Stream, typename K, typename V>
+inline packer<Stream>& operator<< (packer<Stream>& o, const std::unordered_multimap<K,V>& v)
+{
+    o.pack_map(v.size());
+    for(typename std::unordered_multimap<K,V>::const_iterator it(v.begin()), it_end(v.end());
+            it != it_end; ++it) {
+        o.pack(it->first);
+        o.pack(it->second);
+    }
+    return o;
+}
+
+template <typename K, typename V>
+inline void operator<< (object::with_zone& o, const std::unordered_multimap<K,V>& v)
+{
+    o.type = type::MAP;
+    if(v.empty()) {
+        o.via.map.ptr  = nullptr;
+        o.via.map.size = 0;
+    } else {
+        object_kv* p = static_cast<object_kv*>(o.zone.allocate_align(sizeof(object_kv)*v.size()));
+        object_kv* const pend = p + v.size();
+        o.via.map.ptr  = p;
+        o.via.map.size = v.size();
+        typename std::unordered_multimap<K,V>::const_iterator it(v.begin());
+        do {
+            p->key = object(it->first, o.zone);
+            p->val = object(it->second, o.zone);
+            ++p;
+            ++it;
+        } while(p < pend);
+    }
+}
+
+}  // MSGPACK_API_VERSION_NAMESPACE(v1)
+
+}  // namespace msgpack
+
+
+#endif // MSGPACK_TYPE_UNORDERED_MAP_HPP