| 1 |
#include "UnitTest++.h" |
| 2 |
|
| 3 |
#include "test_utils.hh" |
| 4 |
|
| 5 |
#include "geners/StringArchive.hh" |
| 6 |
#include "geners/RowPacker.hh" |
| 7 |
|
| 8 |
using namespace gs; |
| 9 |
using namespace std; |
| 10 |
|
| 11 |
#ifdef CPP11_STD_AVAILABLE |
| 12 |
|
| 13 |
namespace { |
| 14 |
TEST(RowPacker) |
| 15 |
{ |
| 16 |
StringArchive ar0("archive"); |
| 17 |
|
| 18 |
// Test that archive works with bare tuples |
| 19 |
auto tuple1 = tuple<int, float, double, long long>(); |
| 20 |
|
| 21 |
typedef RowPacker<decltype(tuple1)> Packer1; |
| 22 |
const unsigned bufferSize = 1024; |
| 23 |
Packer1 packer({"i1", "f1", "d1", "ll1"}, |
| 24 |
"Title", ar0, "Name", "Category", bufferSize); |
| 25 |
std::vector<decltype(tuple1)> t1copy; |
| 26 |
|
| 27 |
// We need to have enough data to fill at least a few buffers |
| 28 |
// in order to understand if things work correctly. |
| 29 |
unsigned datasize = sizeof(int) + sizeof(float) + sizeof(double) + |
| 30 |
sizeof(long long); |
| 31 |
const unsigned long rows_per_buffer = bufferSize/datasize + 1; |
| 32 |
const unsigned long nrows = 5*rows_per_buffer + 1; |
| 33 |
|
| 34 |
for (unsigned long row=0; row<nrows; ++row) |
| 35 |
{ |
| 36 |
tuple1 = make_tuple( |
| 37 |
(int)(test_rng()*10000), |
| 38 |
(float)(test_rng()), |
| 39 |
(double)(test_rng()), |
| 40 |
(long long)(test_rng()*100000) |
| 41 |
); |
| 42 |
t1copy.push_back(tuple1); |
| 43 |
CHECK(packer.fill(tuple1)); |
| 44 |
} |
| 45 |
|
| 46 |
// Now, let see if we can compare the contents to the |
| 47 |
// original tuple |
| 48 |
CHECK_EQUAL(nrows, packer.nRows()); |
| 49 |
CHECK_EQUAL(std::tuple_size<decltype(tuple1)>::value, |
| 50 |
packer.nColumns()); |
| 51 |
for (unsigned long row=0; row<nrows; ++row) |
| 52 |
{ |
| 53 |
packer.rowContents(row, &tuple1); |
| 54 |
CHECK(tuple1 == t1copy[row]); |
| 55 |
} |
| 56 |
|
| 57 |
// Write the packer to the archive and redo the comparison |
| 58 |
packer.write(); |
| 59 |
CHECK_EQUAL(nrows, packer.nRows()); |
| 60 |
CHECK_EQUAL(std::tuple_size<decltype(tuple1)>::value, |
| 61 |
packer.nColumns()); |
| 62 |
for (unsigned long row=0; row<nrows; ++row) |
| 63 |
{ |
| 64 |
packer.rowContents(row, &tuple1); |
| 65 |
CHECK(tuple1 == t1copy[row]); |
| 66 |
} |
| 67 |
|
| 68 |
// Check if we can read the packer back |
| 69 |
std::unique_ptr<Packer1> rp = |
| 70 |
RPReference<Packer1>(ar0, "Name", "Category").get(0); |
| 71 |
assert(rp.get()); |
| 72 |
|
| 73 |
CHECK_EQUAL(nrows, rp->nRows()); |
| 74 |
CHECK_EQUAL(std::tuple_size<decltype(tuple1)>::value, rp->nColumns()); |
| 75 |
for (unsigned long row=0; row<nrows; ++row) |
| 76 |
{ |
| 77 |
rp->rowContents(row, &tuple1); |
| 78 |
CHECK(tuple1 == t1copy[row]); |
| 79 |
} |
| 80 |
|
| 81 |
CHECK(*rp == packer); |
| 82 |
} |
| 83 |
} |
| 84 |
|
| 85 |
#else // CPP11_STD_AVAILABLE |
| 86 |
|
| 87 |
namespace { |
| 88 |
TEST(RowPacker) |
| 89 |
{ |
| 90 |
} |
| 91 |
} |
| 92 |
|
| 93 |
#endif // CPP11_STD_AVAILABLE |