| 1 |
#include "UnitTest++.h" |
| 2 |
|
| 3 |
#include "test_utils.hh" |
| 4 |
|
| 5 |
#include "geners/unordered_mapIO.hh" |
| 6 |
#include "geners/unordered_setIO.hh" |
| 7 |
#include "geners/StringArchive.hh" |
| 8 |
#include "geners/Record.hh" |
| 9 |
#include "geners/Reference.hh" |
| 10 |
|
| 11 |
using namespace gs; |
| 12 |
using namespace std; |
| 13 |
|
| 14 |
#ifdef CPP11_STD_AVAILABLE |
| 15 |
|
| 16 |
namespace { |
| 17 |
TEST(unorderedIO) |
| 18 |
{ |
| 19 |
StringArchive ar0("archive"); |
| 20 |
|
| 21 |
unordered_map<string,int> m0; |
| 22 |
unordered_set<string> s0; |
| 23 |
|
| 24 |
unordered_map<string,int> m1; |
| 25 |
m1.insert(std::make_pair(std::string("haha"),123)); |
| 26 |
unordered_set<string> s1; |
| 27 |
s1.insert(std::string("foo")); |
| 28 |
|
| 29 |
unordered_map<string,int> m2; |
| 30 |
for (unsigned i=0; i<10; ++i) |
| 31 |
m2.insert(std::make_pair(random_string(5), |
| 32 |
static_cast<int>(test_rng()*10000-5000))); |
| 33 |
unordered_set<string> s2; |
| 34 |
for (unsigned i=0; i<5; ++i) |
| 35 |
s2.insert(random_string(10)); |
| 36 |
|
| 37 |
unordered_multimap<string,int> m3; |
| 38 |
for (unsigned i=0; i<10; ++i) |
| 39 |
m3.insert(std::make_pair(random_string(7), |
| 40 |
static_cast<int>(test_rng()*10000-5000))); |
| 41 |
unordered_multiset<string> s3; |
| 42 |
for (unsigned i=0; i<5; ++i) |
| 43 |
s3.insert(random_string(10)); |
| 44 |
|
| 45 |
ar0 << Record(s0, "s0", "top"); |
| 46 |
ar0 << Record(s1, "s1", "top"); |
| 47 |
ar0 << Record(s2, "s2", "top"); |
| 48 |
ar0 << Record(m0, "m0", "top"); |
| 49 |
ar0 << Record(m1, "m1", "top"); |
| 50 |
ar0 << Record(m2, "m2", "top"); |
| 51 |
ar0 << Record(s3, "s3", "top"); |
| 52 |
ar0 << Record(m3, "m3", "top"); |
| 53 |
|
| 54 |
// Get them back |
| 55 |
decltype(s0) s0_read; |
| 56 |
Reference<decltype(s0)>(ar0, "s0", "top").restore(0,&s0_read); |
| 57 |
CHECK(s0_read == s0); |
| 58 |
|
| 59 |
decltype(s1) s1_read; |
| 60 |
Reference<decltype(s1)>(ar0, "s1", "top").restore(0,&s1_read); |
| 61 |
CHECK(s1_read == s1); |
| 62 |
|
| 63 |
decltype(s2) s2_read; |
| 64 |
Reference<decltype(s2)>(ar0, "s2", "top").restore(0,&s2_read); |
| 65 |
CHECK(s2_read == s2); |
| 66 |
|
| 67 |
decltype(s3) s3_read; |
| 68 |
Reference<decltype(s3)>(ar0, "s3", "top").restore(0,&s3_read); |
| 69 |
CHECK(s3_read == s3); |
| 70 |
|
| 71 |
decltype(m0) m0_read; |
| 72 |
Reference<decltype(m0)>(ar0, "m0", "top").restore(0,&m0_read); |
| 73 |
CHECK(m0_read == m0); |
| 74 |
|
| 75 |
decltype(m1) m1_read; |
| 76 |
Reference<decltype(m1)>(ar0, "m1", "top").restore(0,&m1_read); |
| 77 |
CHECK(m1_read == m1); |
| 78 |
|
| 79 |
decltype(m2) m2_read; |
| 80 |
Reference<decltype(m2)>(ar0, "m2", "top").restore(0,&m2_read); |
| 81 |
CHECK(m2_read == m2); |
| 82 |
|
| 83 |
decltype(m3) m3_read; |
| 84 |
Reference<decltype(m3)>(ar0, "m3", "top").restore(0,&m3_read); |
| 85 |
CHECK(m3_read == m3); |
| 86 |
} |
| 87 |
} |
| 88 |
|
| 89 |
#else // CPP11_STD_AVAILABLE |
| 90 |
|
| 91 |
namespace { |
| 92 |
TEST(unorderedIO) |
| 93 |
{ |
| 94 |
} |
| 95 |
} |
| 96 |
|
| 97 |
#endif // CPP11_STD_AVAILABLE |