summaryrefslogtreecommitdiff
path: root/cpp/msgpack_test.cpp
diff options
context:
space:
mode:
authorfrsyuki <frsyuki@users.sourceforge.jp>2010-04-18 00:08:03 +0900
committerfrsyuki <frsyuki@users.sourceforge.jp>2010-04-18 00:08:03 +0900
commitab8e0c9e31585b24f1d4cbfb1e73b0ce249e408a (patch)
tree042100bffb170e6bec88cc497345bd4074e2f067 /cpp/msgpack_test.cpp
parentc3f43fb0cf14f596a9ebb1c30b0417b3a8ba9958 (diff)
downloadmsgpack-python-ab8e0c9e31585b24f1d4cbfb1e73b0ce249e408a.tar.gz
c,cpp: reforms source tree
Diffstat (limited to 'cpp/msgpack_test.cpp')
-rw-r--r--cpp/msgpack_test.cpp982
1 files changed, 982 insertions, 0 deletions
diff --git a/cpp/msgpack_test.cpp b/cpp/msgpack_test.cpp
new file mode 100644
index 0000000..113914a
--- /dev/null
+++ b/cpp/msgpack_test.cpp
@@ -0,0 +1,982 @@
+#include "msgpack.hpp"
+
+#include <math.h>
+#include <string>
+#include <vector>
+#include <map>
+#include <deque>
+#include <set>
+#include <list>
+
+#include <gtest/gtest.h>
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+using namespace std;
+
+const unsigned int kLoop = 10000;
+const unsigned int kElements = 100;
+const double kEPS = 1e-10;
+
+#define GEN_TEST(test_type) \
+ do { \
+ vector<test_type> v; \
+ v.push_back(0); \
+ v.push_back(1); \
+ v.push_back(2); \
+ v.push_back(numeric_limits<test_type>::min()); \
+ v.push_back(numeric_limits<test_type>::max()); \
+ for (unsigned int i = 0; i < kLoop; i++) \
+ v.push_back(rand()); \
+ for (unsigned int i = 0; i < v.size() ; i++) { \
+ msgpack::sbuffer sbuf; \
+ test_type val1 = v[i]; \
+ msgpack::pack(sbuf, val1); \
+ msgpack::zone z; \
+ msgpack::object obj; \
+ msgpack::unpack_return ret = \
+ msgpack::unpack(sbuf.data(), sbuf.size(), NULL, &z, &obj); \
+ EXPECT_EQ(msgpack::UNPACK_SUCCESS, ret); \
+ test_type val2; \
+ obj.convert(&val2); \
+ EXPECT_EQ(val1, val2); \
+ } \
+} while(0)
+
+TEST(MSGPACK, simple_buffer_short)
+{
+ GEN_TEST(short);
+}
+
+TEST(MSGPACK, simple_buffer_int)
+{
+ GEN_TEST(int);
+}
+
+TEST(MSGPACK, simple_buffer_long)
+{
+ GEN_TEST(long);
+}
+
+TEST(MSGPACK, simple_buffer_long_long)
+{
+ GEN_TEST(long long);
+}
+
+TEST(MSGPACK, simple_buffer_unsigned_short)
+{
+ GEN_TEST(unsigned short);
+}
+
+TEST(MSGPACK, simple_buffer_unsigned_int)
+{
+ GEN_TEST(unsigned int);
+}
+
+TEST(MSGPACK, simple_buffer_unsigned_long)
+{
+ GEN_TEST(unsigned long);
+}
+
+TEST(MSGPACK, simple_buffer_unsigned_long_long)
+{
+ GEN_TEST(unsigned long long);
+}
+
+TEST(MSGPACK, simple_buffer_uint8)
+{
+ GEN_TEST(uint8_t);
+}
+
+TEST(MSGPACK, simple_buffer_uint16)
+{
+ GEN_TEST(uint16_t);
+}
+
+TEST(MSGPACK, simple_buffer_uint32)
+{
+ GEN_TEST(uint32_t);
+}
+
+TEST(MSGPACK, simple_buffer_uint64)
+{
+ GEN_TEST(uint64_t);
+}
+
+TEST(MSGPACK, simple_buffer_int8)
+{
+ GEN_TEST(int8_t);
+}
+
+TEST(MSGPACK, simple_buffer_int16)
+{
+ GEN_TEST(int16_t);
+}
+
+TEST(MSGPACK, simple_buffer_int32)
+{
+ GEN_TEST(int32_t);
+}
+
+TEST(MSGPACK, simple_buffer_int64)
+{
+ GEN_TEST(int64_t);
+}
+
+TEST(MSGPACK, simple_buffer_float)
+{
+ vector<float> v;
+ v.push_back(0.0);
+ v.push_back(-0.0);
+ v.push_back(1.0);
+ v.push_back(-1.0);
+ v.push_back(numeric_limits<float>::min());
+ v.push_back(numeric_limits<float>::max());
+ v.push_back(nanf("tag"));
+ v.push_back(1.0/0.0); // inf
+ v.push_back(-(1.0/0.0)); // -inf
+ for (unsigned int i = 0; i < kLoop; i++) {
+ v.push_back(drand48());
+ v.push_back(-drand48());
+ }
+ for (unsigned int i = 0; i < v.size() ; i++) {
+ msgpack::sbuffer sbuf;
+ float val1 = v[i];
+ msgpack::pack(sbuf, val1);
+ msgpack::zone z;
+ msgpack::object obj;
+ msgpack::unpack_return ret =
+ msgpack::unpack(sbuf.data(), sbuf.size(), NULL, &z, &obj);
+ EXPECT_EQ(msgpack::UNPACK_SUCCESS, ret);
+ float val2;
+ obj.convert(&val2);
+
+ if (isnan(val1))
+ EXPECT_TRUE(isnan(val2));
+ else if (isinf(val1))
+ EXPECT_TRUE(isinf(val2));
+ else
+ EXPECT_TRUE(fabs(val2 - val1) <= kEPS);
+ }
+}
+
+TEST(MSGPACK, simple_buffer_double)
+{
+ vector<double> v;
+ v.push_back(0.0);
+ v.push_back(-0.0);
+ v.push_back(1.0);
+ v.push_back(-1.0);
+ v.push_back(numeric_limits<double>::min());
+ v.push_back(numeric_limits<double>::max());
+ v.push_back(nanf("tag"));
+ v.push_back(1.0/0.0); // inf
+ v.push_back(-(1.0/0.0)); // -inf
+ for (unsigned int i = 0; i < kLoop; i++) {
+ v.push_back(drand48());
+ v.push_back(-drand48());
+ }
+ for (unsigned int i = 0; i < v.size() ; i++) {
+ msgpack::sbuffer sbuf;
+ double val1 = v[i];
+ msgpack::pack(sbuf, val1);
+ msgpack::zone z;
+ msgpack::object obj;
+ msgpack::unpack_return ret =
+ msgpack::unpack(sbuf.data(), sbuf.size(), NULL, &z, &obj);
+ EXPECT_EQ(msgpack::UNPACK_SUCCESS, ret);
+ double val2;
+ obj.convert(&val2);
+
+ if (isnan(val1))
+ EXPECT_TRUE(isnan(val2));
+ else if (isinf(val1))
+ EXPECT_TRUE(isinf(val2));
+ else
+ EXPECT_TRUE(fabs(val2 - val1) <= kEPS);
+ }
+}
+
+TEST(MSGPACK, simple_buffer_true)
+{
+ msgpack::sbuffer sbuf;
+ bool val1 = true;
+ msgpack::pack(sbuf, val1);
+ msgpack::zone z;
+ msgpack::object obj;
+ msgpack::unpack_return ret =
+ msgpack::unpack(sbuf.data(), sbuf.size(), NULL, &z, &obj);
+ EXPECT_EQ(msgpack::UNPACK_SUCCESS, ret);
+ bool val2;
+ obj.convert(&val2);
+ EXPECT_EQ(val1, val2);
+}
+
+TEST(MSGPACK, simple_buffer_false)
+{
+ msgpack::sbuffer sbuf;
+ bool val1 = false;
+ msgpack::pack(sbuf, val1);
+ msgpack::zone z;
+ msgpack::object obj;
+ msgpack::unpack_return ret =
+ msgpack::unpack(sbuf.data(), sbuf.size(), NULL, &z, &obj);
+ EXPECT_EQ(msgpack::UNPACK_SUCCESS, ret);
+ bool val2;
+ obj.convert(&val2);
+ EXPECT_EQ(val1, val2);
+}
+
+//-----------------------------------------------------------------------------
+
+// STL
+
+TEST(MSGPACK_STL, simple_buffer_string)
+{
+ for (unsigned int k = 0; k < kLoop; k++) {
+ string val1;
+ for (unsigned int i = 0; i < kElements; i++)
+ val1 += 'a' + rand() % 26;
+ msgpack::sbuffer sbuf;
+ msgpack::pack(sbuf, val1);
+ msgpack::zone z;
+ msgpack::object obj;
+ msgpack::unpack_return ret =
+ msgpack::unpack(sbuf.data(), sbuf.size(), NULL, &z, &obj);
+ EXPECT_EQ(msgpack::UNPACK_SUCCESS, ret);
+ string val2;
+ obj.convert(&val2);
+ EXPECT_EQ(val1.size(), val2.size());
+ EXPECT_EQ(val1, val2);
+ }
+}
+
+TEST(MSGPACK_STL, simple_buffer_vector)
+{
+ for (unsigned int k = 0; k < kLoop; k++) {
+ vector<int> val1;
+ for (unsigned int i = 0; i < kElements; i++)
+ val1.push_back(rand());
+ msgpack::sbuffer sbuf;
+ msgpack::pack(sbuf, val1);
+ msgpack::zone z;
+ msgpack::object obj;
+ msgpack::unpack_return ret =
+ msgpack::unpack(sbuf.data(), sbuf.size(), NULL, &z, &obj);
+ EXPECT_EQ(msgpack::UNPACK_SUCCESS, ret);
+ vector<int> val2;
+ obj.convert(&val2);
+ EXPECT_EQ(val1.size(), val2.size());
+ EXPECT_TRUE(equal(val1.begin(), val1.end(), val2.begin()));
+ }
+}
+
+TEST(MSGPACK_STL, simple_buffer_map)
+{
+ for (unsigned int k = 0; k < kLoop; k++) {
+ map<int, int> val1;
+ for (unsigned int i = 0; i < kElements; i++)
+ val1[rand()] = rand();
+ msgpack::sbuffer sbuf;
+ msgpack::pack(sbuf, val1);
+ msgpack::zone z;
+ msgpack::object obj;
+ msgpack::unpack_return ret =
+ msgpack::unpack(sbuf.data(), sbuf.size(), NULL, &z, &obj);
+ EXPECT_EQ(msgpack::UNPACK_SUCCESS, ret);
+ map<int, int> val2;
+ obj.convert(&val2);
+ EXPECT_EQ(val1.size(), val2.size());
+ EXPECT_TRUE(equal(val1.begin(), val1.end(), val2.begin()));
+ }
+}
+
+TEST(MSGPACK_STL, simple_buffer_deque)
+{
+ for (unsigned int k = 0; k < kLoop; k++) {
+ deque<int> val1;
+ for (unsigned int i = 0; i < kElements; i++)
+ val1.push_back(rand());
+ msgpack::sbuffer sbuf;
+ msgpack::pack(sbuf, val1);
+ msgpack::zone z;
+ msgpack::object obj;
+ msgpack::unpack_return ret =
+ msgpack::unpack(sbuf.data(), sbuf.size(), NULL, &z, &obj);
+ EXPECT_EQ(msgpack::UNPACK_SUCCESS, ret);
+ deque<int> val2;
+ obj.convert(&val2);
+ EXPECT_EQ(val1.size(), val2.size());
+ EXPECT_TRUE(equal(val1.begin(), val1.end(), val2.begin()));
+ }
+}
+
+TEST(MSGPACK_STL, simple_buffer_list)
+{
+ for (unsigned int k = 0; k < kLoop; k++) {
+ list<int> val1;
+ for (unsigned int i = 0; i < kElements; i++)
+ val1.push_back(rand());
+ msgpack::sbuffer sbuf;
+ msgpack::pack(sbuf, val1);
+ msgpack::zone z;
+ msgpack::object obj;
+ msgpack::unpack_return ret =
+ msgpack::unpack(sbuf.data(), sbuf.size(), NULL, &z, &obj);
+ EXPECT_EQ(msgpack::UNPACK_SUCCESS, ret);
+ list<int> val2;
+ obj.convert(&val2);
+ EXPECT_EQ(val1.size(), val2.size());
+ EXPECT_TRUE(equal(val1.begin(), val1.end(), val2.begin()));
+ }
+}
+
+TEST(MSGPACK_STL, simple_buffer_set)
+{
+ for (unsigned int k = 0; k < kLoop; k++) {
+ set<int> val1;
+ for (unsigned int i = 0; i < kElements; i++)
+ val1.insert(rand());
+ msgpack::sbuffer sbuf;
+ msgpack::pack(sbuf, val1);
+ msgpack::zone z;
+ msgpack::object obj;
+ msgpack::unpack_return ret =
+ msgpack::unpack(sbuf.data(), sbuf.size(), NULL, &z, &obj);
+ EXPECT_EQ(msgpack::UNPACK_SUCCESS, ret);
+ set<int> val2;
+ obj.convert(&val2);
+ EXPECT_EQ(val1.size(), val2.size());
+ EXPECT_TRUE(equal(val1.begin(), val1.end(), val2.begin()));
+ }
+}
+
+TEST(MSGPACK_STL, simple_buffer_pair)
+{
+ for (unsigned int k = 0; k < kLoop; k++) {
+ pair<int, int> val1 = make_pair(rand(), rand());
+ msgpack::sbuffer sbuf;
+ msgpack::pack(sbuf, val1);
+ msgpack::zone z;
+ msgpack::object obj;
+ msgpack::unpack_return ret =
+ msgpack::unpack(sbuf.data(), sbuf.size(), NULL, &z, &obj);
+ EXPECT_EQ(msgpack::UNPACK_SUCCESS, ret);
+ pair<int, int> val2;
+ obj.convert(&val2);
+ EXPECT_EQ(val1.first, val2.first);
+ EXPECT_EQ(val1.second, val2.second);
+ }
+}
+
+TEST(MSGPACK_STL, simple_buffer_multimap)
+{
+ for (unsigned int k = 0; k < kLoop; k++) {
+ multimap<int, int> val1;
+ for (unsigned int i = 0; i < kElements; i++) {
+ int i1 = rand();
+ val1.insert(make_pair(i1, rand()));
+ val1.insert(make_pair(i1, rand()));
+ }
+ msgpack::sbuffer sbuf;
+ msgpack::pack(sbuf, val1);
+ msgpack::zone z;
+ msgpack::object obj;
+ msgpack::unpack_return ret =
+ msgpack::unpack(sbuf.data(), sbuf.size(), NULL, &z, &obj);
+ EXPECT_EQ(msgpack::UNPACK_SUCCESS, ret);
+ multimap<int, int> val2;
+ obj.convert(&val2);
+
+ vector<pair<int, int> > v1, v2;
+ multimap<int, int>::const_iterator it;
+ for (it = val1.begin(); it != val1.end(); ++it)
+ v1.push_back(make_pair(it->first, it->second));
+ for (it = val2.begin(); it != val2.end(); ++it)
+ v2.push_back(make_pair(it->first, it->second));
+ EXPECT_EQ(val1.size(), val2.size());
+ EXPECT_EQ(v1.size(), v2.size());
+ sort(v1.begin(), v1.end());
+ sort(v2.begin(), v2.end());
+ EXPECT_TRUE(v1 == v2);
+ }
+}
+
+TEST(MSGPACK_STL, simple_buffer_multiset)
+{
+ for (unsigned int k = 0; k < kLoop; k++) {
+ multiset<int> val1;
+ for (unsigned int i = 0; i < kElements; i++)
+ val1.insert(rand());
+ msgpack::sbuffer sbuf;
+ msgpack::pack(sbuf, val1);
+ msgpack::zone z;
+ msgpack::object obj;
+ msgpack::unpack_return ret =
+ msgpack::unpack(sbuf.data(), sbuf.size(), NULL, &z, &obj);
+ EXPECT_EQ(msgpack::UNPACK_SUCCESS, ret);
+ multiset<int> val2;
+ obj.convert(&val2);
+
+ vector<int> v1, v2;
+ multiset<int>::const_iterator it;
+ for (it = val1.begin(); it != val1.end(); ++it)
+ v1.push_back(*it);
+ for (it = val2.begin(); it != val2.end(); ++it)
+ v2.push_back(*it);
+ EXPECT_EQ(val1.size(), val2.size());
+ EXPECT_EQ(v1.size(), v2.size());
+ sort(v1.begin(), v1.end());
+ sort(v2.begin(), v2.end());
+ EXPECT_TRUE(v1 == v2);
+ }
+}
+
+// TR1
+
+#ifdef HAVE_TR1_UNORDERED_MAP
+#include <tr1/unordered_map>
+#include "cpp/msgpack/type/tr1/unordered_map.hpp"
+TEST(MSGPACK_TR1, simple_buffer_unordered_map)
+{
+ for (unsigned int k = 0; k < kLoop; k++) {
+ tr1::unordered_map<int, int> val1;
+ for (unsigned int i = 0; i < kElements; i++)
+ val1[rand()] = rand();
+ msgpack::sbuffer sbuf;
+ msgpack::pack(sbuf, val1);
+ msgpack::zone z;
+ msgpack::object obj;
+ msgpack::unpack_return ret =
+ msgpack::unpack(sbuf.data(), sbuf.size(), NULL, &z, &obj);
+ EXPECT_EQ(msgpack::UNPACK_SUCCESS, ret);
+ tr1::unordered_map<int, int> val2;
+ obj.convert(&val2);
+ EXPECT_EQ(val1.size(), val2.size());
+ tr1::unordered_map<int, int>::const_iterator it;
+ for (it = val1.begin(); it != val1.end(); ++it) {
+ EXPECT_TRUE(val2.find(it->first) != val2.end());
+ EXPECT_EQ(it->second, val2.find(it->first)->second);
+ }
+ }
+}
+
+TEST(MSGPACK_TR1, simple_buffer_unordered_multimap)
+{
+ for (unsigned int k = 0; k < kLoop; k++) {
+ tr1::unordered_multimap<int, int> val1;
+ for (unsigned int i = 0; i < kElements; i++) {
+ int i1 = rand();
+ val1.insert(make_pair(i1, rand()));
+ val1.insert(make_pair(i1, rand()));
+ }
+ msgpack::sbuffer sbuf;
+ msgpack::pack(sbuf, val1);
+ msgpack::zone z;
+ msgpack::object obj;
+ msgpack::unpack_return ret =
+ msgpack::unpack(sbuf.data(), sbuf.size(), NULL, &z, &obj);
+ EXPECT_EQ(msgpack::UNPACK_SUCCESS, ret);
+ tr1::unordered_multimap<int, int> val2;
+ obj.convert(&val2);
+
+ vector<pair<int, int> > v1, v2;
+ tr1::unordered_multimap<int, int>::const_iterator it;
+ for (it = val1.begin(); it != val1.end(); ++it)
+ v1.push_back(make_pair(it->first, it->second));
+ for (it = val2.begin(); it != val2.end(); ++it)
+ v2.push_back(make_pair(it->first, it->second));
+ EXPECT_EQ(val1.size(), val2.size());
+ EXPECT_EQ(v1.size(), v2.size());
+ sort(v1.begin(), v1.end());
+ sort(v2.begin(), v2.end());
+ EXPECT_TRUE(v1 == v2);
+ }
+}
+#endif
+
+#ifdef HAVE_TR1_UNORDERED_SET
+#include <tr1/unordered_set>
+#include "cpp/msgpack/type/tr1/unordered_set.hpp"
+TEST(MSGPACK_TR1, simple_buffer_unordered_set)
+{
+ for (unsigned int k = 0; k < kLoop; k++) {
+ tr1::unordered_set<int> val1;
+ for (unsigned int i = 0; i < kElements; i++)
+ val1.insert(rand());
+ msgpack::sbuffer sbuf;
+ msgpack::pack(sbuf, val1);
+ msgpack::zone z;
+ msgpack::object obj;
+ msgpack::unpack_return ret =
+ msgpack::unpack(sbuf.data(), sbuf.size(), NULL, &z, &obj);
+ EXPECT_EQ(msgpack::UNPACK_SUCCESS, ret);
+ tr1::unordered_set<int> val2;
+ obj.convert(&val2);
+ EXPECT_EQ(val1.size(), val2.size());
+ tr1::unordered_set<int>::const_iterator it;
+ for (it = val1.begin(); it != val1.end(); ++it)
+ EXPECT_TRUE(val2.find(*it) != val2.end());
+ }
+}
+
+TEST(MSGPACK_TR1, simple_buffer_unordered_multiset)
+{
+ for (unsigned int k = 0; k < kLoop; k++) {
+ tr1::unordered_multiset<int> val1;
+ for (unsigned int i = 0; i < kElements; i++)
+ val1.insert(rand());
+ msgpack::sbuffer sbuf;
+ msgpack::pack(sbuf, val1);
+ msgpack::zone z;
+ msgpack::object obj;
+ msgpack::unpack_return ret =
+ msgpack::unpack(sbuf.data(), sbuf.size(), NULL, &z, &obj);
+ EXPECT_EQ(msgpack::UNPACK_SUCCESS, ret);
+ tr1::unordered_multiset<int> val2;
+ obj.convert(&val2);
+
+ vector<int> v1, v2;
+ tr1::unordered_multiset<int>::const_iterator it;
+ for (it = val1.begin(); it != val1.end(); ++it)
+ v1.push_back(*it);
+ for (it = val2.begin(); it != val2.end(); ++it)
+ v2.push_back(*it);
+ EXPECT_EQ(val1.size(), val2.size());
+ EXPECT_EQ(v1.size(), v2.size());
+ sort(v1.begin(), v1.end());
+ sort(v2.begin(), v2.end());
+ EXPECT_TRUE(v1 == v2);
+ }
+}
+#endif
+
+// User-Defined Structures
+
+class TestClass
+{
+public:
+ TestClass() : i(0), s("kzk") {}
+ int i;
+ string s;
+ MSGPACK_DEFINE(i, s);
+};
+
+TEST(MSGPACK_USER_DEFINED, simple_buffer_class)
+{
+ for (unsigned int k = 0; k < kLoop; k++) {
+ TestClass val1;
+ msgpack::sbuffer sbuf;
+ msgpack::pack(sbuf, val1);
+ msgpack::zone z;
+ msgpack::object obj;
+ msgpack::unpack_return ret =
+ msgpack::unpack(sbuf.data(), sbuf.size(), NULL, &z, &obj);
+ EXPECT_EQ(msgpack::UNPACK_SUCCESS, ret);
+ TestClass val2;
+ val2.i = -1;
+ val2.s = "";
+ obj.convert(&val2);
+ EXPECT_EQ(val1.i, val2.i);
+ EXPECT_EQ(val1.s, val2.s);
+ }
+}
+
+class TestClass2
+{
+public:
+ TestClass2() : i(0), s("kzk") {
+ for (unsigned int i = 0; i < kElements; i++)
+ v.push_back(rand());
+ }
+ int i;
+ string s;
+ vector<int> v;
+ MSGPACK_DEFINE(i, s, v);
+};
+
+TEST(MSGPACK_USER_DEFINED, simple_buffer_class_old_to_new)
+{
+ for (unsigned int k = 0; k < kLoop; k++) {
+ TestClass val1;
+ msgpack::sbuffer sbuf;
+ msgpack::pack(sbuf, val1);
+ msgpack::zone z;
+ msgpack::object obj;
+ msgpack::unpack_return ret =
+ msgpack::unpack(sbuf.data(), sbuf.size(), NULL, &z, &obj);
+ EXPECT_EQ(msgpack::UNPACK_SUCCESS, ret);
+ TestClass2 val2;
+ val2.i = -1;
+ val2.s = "";
+ val2.v = vector<int>();
+ obj.convert(&val2);
+ EXPECT_EQ(val1.i, val2.i);
+ EXPECT_EQ(val1.s, val2.s);
+ EXPECT_FALSE(val2.s.empty());
+ }
+}
+
+TEST(MSGPACK_USER_DEFINED, simple_buffer_class_new_to_old)
+{
+ for (unsigned int k = 0; k < kLoop; k++) {
+ TestClass2 val1;
+ msgpack::sbuffer sbuf;
+ msgpack::pack(sbuf, val1);
+ msgpack::zone z;
+ msgpack::object obj;
+ msgpack::unpack_return ret =
+ msgpack::unpack(sbuf.data(), sbuf.size(), NULL, &z, &obj);
+ EXPECT_EQ(msgpack::UNPACK_SUCCESS, ret);
+ TestClass val2;
+ val2.i = -1;
+ val2.s = "";
+ obj.convert(&val2);
+ EXPECT_EQ(val1.i, val2.i);
+ EXPECT_EQ(val1.s, val2.s);
+ EXPECT_FALSE(val2.s.empty());
+ }
+}
+
+class TestEnumMemberClass
+{
+public:
+ TestEnumMemberClass()
+ : t1(STATE_A), t2(STATE_B), t3(STATE_C) {}
+
+ enum TestEnumType {
+ STATE_INVALID = 0,
+ STATE_A = 1,
+ STATE_B = 2,
+ STATE_C = 3
+ };
+ TestEnumType t1;
+ TestEnumType t2;
+ TestEnumType t3;
+
+ MSGPACK_DEFINE((int&)t1, (int&)t2, (int&)t3);
+};
+
+TEST(MSGPACK_USER_DEFINED, simple_buffer_enum_member)
+{
+ TestEnumMemberClass val1;
+ msgpack::sbuffer sbuf;
+ msgpack::pack(sbuf, val1);
+ msgpack::zone z;
+ msgpack::object obj;
+ msgpack::unpack_return ret =
+ msgpack::unpack(sbuf.data(), sbuf.size(), NULL, &z, &obj);
+ EXPECT_EQ(msgpack::UNPACK_SUCCESS, ret);
+ TestEnumMemberClass val2;
+ val2.t1 = TestEnumMemberClass::STATE_INVALID;
+ val2.t2 = TestEnumMemberClass::STATE_INVALID;
+ val2.t3 = TestEnumMemberClass::STATE_INVALID;
+ obj.convert(&val2);
+ EXPECT_EQ(val1.t1, val2.t1);
+ EXPECT_EQ(val1.t2, val2.t2);
+ EXPECT_EQ(val1.t3, val2.t3);
+}
+
+class TestUnionMemberClass
+{
+public:
+ TestUnionMemberClass() {}
+ TestUnionMemberClass(double f) {
+ is_double = true;
+ value.f = f;
+ }
+ TestUnionMemberClass(int i) {
+ is_double = false;
+ value.i = i;
+ }
+
+ union {
+ double f;
+ int i;
+ } value;
+ bool is_double;
+
+ template <typename Packer>
+ void msgpack_pack(Packer& pk) const
+ {
+ if (is_double)
+ pk.pack(msgpack::type::tuple<bool, double>(true, value.f));
+ else
+ pk.pack(msgpack::type::tuple<bool, int>(false, value.i));
+ }
+
+ void msgpack_unpack(msgpack::object o)
+ {
+ msgpack::type::tuple<bool, msgpack::object> tuple;
+ o.convert(&tuple);
+
+ is_double = tuple.get<0>();
+ if (is_double)
+ tuple.get<1>().convert(&value.f);
+ else
+ tuple.get<1>().convert(&value.i);
+ }
+};
+
+TEST(MSGPACK_USER_DEFINED, simple_buffer_union_member)
+{
+ {
+ // double
+ TestUnionMemberClass val1(1.0);
+ msgpack::sbuffer sbuf;
+ msgpack::pack(sbuf, val1);
+ msgpack::zone z;
+ msgpack::object obj;
+ msgpack::unpack_return ret =
+ msgpack::unpack(sbuf.data(), sbuf.size(), NULL, &z, &obj);
+ EXPECT_EQ(msgpack::UNPACK_SUCCESS, ret);
+ TestUnionMemberClass val2;
+ obj.convert(&val2);
+ EXPECT_EQ(val1.is_double, val2.is_double);
+ EXPECT_TRUE(fabs(val1.value.f - val2.value.f) < kEPS);
+ }
+ {
+ // int
+ TestUnionMemberClass val1(1);
+ msgpack::sbuffer sbuf;
+ msgpack::pack(sbuf, val1);
+ msgpack::zone z;
+ msgpack::object obj;
+ msgpack::unpack_return ret =
+ msgpack::unpack(sbuf.data(), sbuf.size(), NULL, &z, &obj);
+ EXPECT_EQ(msgpack::UNPACK_SUCCESS, ret);
+ TestUnionMemberClass val2;
+ obj.convert(&val2);
+ EXPECT_EQ(val1.is_double, val2.is_double);
+ EXPECT_EQ(val1.value.i, 1);
+ EXPECT_EQ(val1.value.i, val2.value.i);
+ }
+}
+
+//-----------------------------------------------------------------------------
+
+#define GEN_TEST_VREF(test_type) \
+ do { \
+ vector<test_type> v; \
+ v.push_back(0); \
+ for (unsigned int i = 0; i < v.size(); i++) { \
+ test_type val1 = v[i]; \
+ msgpack::vrefbuffer vbuf; \
+ msgpack::pack(vbuf, val1); \
+ msgpack::sbuffer sbuf; \
+ const struct iovec* cur = vbuf.vector(); \
+ const struct iovec* end = cur + vbuf.vector_size(); \
+ for(; cur != end; ++cur) \
+ sbuf.write((const char*)cur->iov_base, cur->iov_len); \
+ msgpack::zone z; \
+ msgpack::object obj; \
+ msgpack::unpack_return ret = \
+ msgpack::unpack(sbuf.data(), sbuf.size(), NULL, &z, &obj); \
+ EXPECT_EQ(msgpack::UNPACK_SUCCESS, ret); \
+ test_type val2; \
+ obj.convert(&val2); \
+ EXPECT_EQ(val1, val2); \
+ } \
+ } while(0);
+
+TEST(MSGPACK, vrefbuffer_short)
+{
+ GEN_TEST_VREF(short);
+}
+
+TEST(MSGPACK, vrefbuffer_int)
+{
+ GEN_TEST_VREF(int);
+}
+
+TEST(MSGPACK, vrefbuffer_long)
+{
+ GEN_TEST_VREF(long);
+}
+
+TEST(MSGPACK, vrefbuffer_long_long)
+{
+ GEN_TEST_VREF(long long);
+}
+
+TEST(MSGPACK, vrefbuffer_unsigned_short)
+{
+ GEN_TEST_VREF(unsigned short);
+}
+
+TEST(MSGPACK, vrefbuffer_unsigned_int)
+{
+ GEN_TEST_VREF(unsigned int);
+}
+
+TEST(MSGPACK, vrefbuffer_unsigned_long)
+{
+ GEN_TEST_VREF(unsigned long);
+}
+
+TEST(MSGPACK, vrefbuffer_unsigned_long_long)
+{
+ GEN_TEST_VREF(unsigned long long);
+}
+
+TEST(MSGPACK, vrefbuffer_uint8)
+{
+ GEN_TEST_VREF(uint8_t);
+}
+
+TEST(MSGPACK, vrefbuffer_uint16)
+{
+ GEN_TEST_VREF(uint16_t);
+}
+
+TEST(MSGPACK, vrefbuffer_uint32)
+{
+ GEN_TEST_VREF(uint32_t);
+}
+
+TEST(MSGPACK, vrefbuffer_uint64)
+{
+ GEN_TEST_VREF(uint64_t);
+}
+
+TEST(MSGPACK, vrefbuffer_int8)
+{
+ GEN_TEST_VREF(int8_t);
+}
+
+TEST(MSGPACK, vrefbuffer_int16)
+{
+ GEN_TEST_VREF(int16_t);
+}
+
+TEST(MSGPACK, vrefbuffer_int32)
+{
+ GEN_TEST_VREF(int32_t);
+}
+
+TEST(MSGPACK, vrefbuffer_int64)
+{
+ GEN_TEST_VREF(int64_t);
+}
+
+//-----------------------------------------------------------------------------
+
+#define GEN_TEST_STREAM(test_type) \
+ for (unsigned int k = 0; k < kLoop; k++) { \
+ msgpack::sbuffer sbuf; \
+ msgpack::packer<msgpack::sbuffer> pk(sbuf); \
+ typedef std::vector<test_type> vec_type; \
+ vec_type vec; \
+ for(unsigned int i = 0; i < rand() % kLoop; ++i) { \
+ vec_type::value_type r = rand(); \
+ vec.push_back(r); \
+ pk.pack(r); \
+ } \
+ msgpack::unpacker pac; \
+ vec_type::const_iterator it = vec.begin(); \
+ const char *p = sbuf.data(); \
+ const char * const pend = p + sbuf.size(); \
+ while (p < pend) { \
+ const size_t sz = std::min<size_t>(pend - p, rand() % 128); \
+ pac.reserve_buffer(sz); \
+ memcpy(pac.buffer(), p, sz); \
+ pac.buffer_consumed(sz); \
+ while (pac.execute()) { \
+ if (it == vec.end()) goto out; \
+ msgpack::object obj = pac.data(); \
+ msgpack::zone *life = pac.release_zone(); \
+ EXPECT_TRUE(life != NULL); \
+ pac.reset(); \
+ vec_type::value_type val; \
+ obj.convert(&val); \
+ EXPECT_EQ(*it, val); \
+ ++it; \
+ delete life; \
+ } \
+ p += sz; \
+ } \
+ out: \
+ ; \
+ }
+
+TEST(MSGPACK, stream_short)
+{
+ GEN_TEST_STREAM(short);
+}
+
+TEST(MSGPACK, stream_int)
+{
+ GEN_TEST_STREAM(int);
+}
+
+TEST(MSGPACK, stream_long)
+{
+ GEN_TEST_STREAM(long);
+}
+
+TEST(MSGPACK, stream_long_long)
+{
+ GEN_TEST_STREAM(long long);
+}
+
+TEST(MSGPACK, stream_unsigned_short)
+{
+ GEN_TEST_STREAM(unsigned short);
+}
+
+TEST(MSGPACK, stream_unsigned_int)
+{
+ GEN_TEST_STREAM(unsigned int);
+}
+
+TEST(MSGPACK, stream_unsigned_long)
+{
+ GEN_TEST_STREAM(unsigned long);
+}
+
+TEST(MSGPACK, stream_unsigned_long_long)
+{
+ GEN_TEST_STREAM(unsigned long long);
+}
+
+TEST(MSGPACK, stream_uint8)
+{
+ GEN_TEST_STREAM(uint8_t);
+}
+
+TEST(MSGPACK, stream_uint16)
+{
+ GEN_TEST_STREAM(uint16_t);
+}
+
+TEST(MSGPACK, stream_uint32)
+{
+ GEN_TEST_STREAM(uint32_t);
+}
+
+TEST(MSGPACK, stream_uint64)
+{
+ GEN_TEST_STREAM(uint64_t);
+}
+
+TEST(MSGPACK, stream_int8)
+{
+ GEN_TEST_STREAM(int8_t);
+}
+
+TEST(MSGPACK, stream_int16)
+{
+ GEN_TEST_STREAM(int16_t);
+}
+
+TEST(MSGPACK, stream_int32)
+{
+ GEN_TEST_STREAM(int32_t);
+}
+
+TEST(MSGPACK, stream_int64)
+{
+ GEN_TEST_STREAM(int64_t);
+}