finally methods that actually do something, some testing of them
This commit is contained in:
parent
5fba60f7f0
commit
8cb1e97e30
9 changed files with 348 additions and 12 deletions
|
@ -7,6 +7,7 @@ add_executable(runUnitTests
|
|||
serialization.cpp
|
||||
storagetransaction.cpp
|
||||
cachetransaction.cpp
|
||||
storagecursor.cpp
|
||||
)
|
||||
|
||||
target_compile_options(runUnitTests PRIVATE -fPIC)
|
||||
|
|
167
test/storagecursor.cpp
Normal file
167
test/storagecursor.cpp
Normal file
|
@ -0,0 +1,167 @@
|
|||
#include <gtest/gtest.h>
|
||||
|
||||
#include "base.h"
|
||||
#include "storage.h"
|
||||
#include "cursor.h"
|
||||
|
||||
class StorageCursorTest : public ::testing::Test {
|
||||
protected:
|
||||
StorageCursorTest():
|
||||
::testing::Test(),
|
||||
table (db->getStorage<uint64_t, std::string>("table1")) {}
|
||||
|
||||
~StorageCursorTest() {}
|
||||
|
||||
static void SetUpTestSuite() {
|
||||
if (db == nullptr) {
|
||||
db = new LMDBAL::Base("testBase");
|
||||
db->addStorage<uint64_t, std::string>("table1");
|
||||
db->open();
|
||||
}
|
||||
}
|
||||
|
||||
static void TearDownTestSuite() {
|
||||
db->close();
|
||||
db->removeDirectory();
|
||||
delete db;
|
||||
db = nullptr;
|
||||
}
|
||||
|
||||
static LMDBAL::Base* db;
|
||||
static LMDBAL::Cursor<uint64_t, std::string>* cursor;
|
||||
|
||||
LMDBAL::Storage<uint64_t, std::string>* table;
|
||||
};
|
||||
|
||||
LMDBAL::Base* StorageCursorTest::db = nullptr;
|
||||
LMDBAL::Cursor<uint64_t, std::string>* StorageCursorTest::cursor = nullptr;
|
||||
|
||||
static const std::map<uint64_t, std::string> data({
|
||||
{245665783, "bothering nerds"},
|
||||
{3458, "resilent pick forefront"},
|
||||
{105190, "apportunity legal bat"},
|
||||
{6510, "outside"},
|
||||
{7438537, "damocles plush apparently rusty"},
|
||||
{19373572, "local guidence"},
|
||||
{138842, "forgetting tusks prepare"},
|
||||
{981874, "butchered soaking pawn"},
|
||||
{19302, "tanned inmate"},
|
||||
{178239, "custody speaks neurotic"},
|
||||
});
|
||||
|
||||
TEST_F(StorageCursorTest, PopulatingTheTable) {
|
||||
|
||||
uint32_t amount = table->addRecords(data);
|
||||
EXPECT_EQ(amount, data.size());
|
||||
}
|
||||
|
||||
TEST_F(StorageCursorTest, Creation) {
|
||||
cursor = table->createCursor();
|
||||
|
||||
EXPECT_THROW(cursor->first(), LMDBAL::CursorNotReady);
|
||||
EXPECT_THROW(cursor->last(), LMDBAL::CursorNotReady);
|
||||
EXPECT_THROW(cursor->next(), LMDBAL::CursorNotReady);
|
||||
EXPECT_THROW(cursor->prev(), LMDBAL::CursorNotReady);
|
||||
EXPECT_THROW(cursor->current(), LMDBAL::CursorNotReady);
|
||||
|
||||
cursor->open();
|
||||
}
|
||||
|
||||
TEST_F(StorageCursorTest, FirstPrivate) {
|
||||
std::pair<uint64_t, std::string> element = cursor->first();
|
||||
std::map<uint64_t, std::string>::const_iterator reference = data.begin();
|
||||
|
||||
EXPECT_EQ(element.first, reference->first);
|
||||
EXPECT_EQ(element.second, reference->second);
|
||||
}
|
||||
|
||||
TEST_F(StorageCursorTest, NextPrivate) {
|
||||
std::map<uint64_t, std::string>::const_iterator reference = data.begin();
|
||||
|
||||
reference++;
|
||||
for (; reference != data.end(); ++reference) {
|
||||
std::pair<uint64_t, std::string> element = cursor->next();
|
||||
EXPECT_EQ(element.first, reference->first);
|
||||
EXPECT_EQ(element.second, reference->second);
|
||||
}
|
||||
|
||||
EXPECT_THROW(cursor->next(), LMDBAL::NotFound);
|
||||
|
||||
std::pair<uint64_t, std::string> element = cursor->first();
|
||||
reference = data.begin();
|
||||
|
||||
EXPECT_EQ(element.first, reference->first);
|
||||
EXPECT_EQ(element.second, reference->second);
|
||||
}
|
||||
|
||||
TEST_F(StorageCursorTest, LastPrivate) {
|
||||
std::pair<uint64_t, std::string> element = cursor->last();
|
||||
std::map<uint64_t, std::string>::const_reverse_iterator reference = data.rbegin();
|
||||
|
||||
EXPECT_EQ(element.first, reference->first);
|
||||
EXPECT_EQ(element.second, reference->second);
|
||||
}
|
||||
|
||||
TEST_F(StorageCursorTest, PrevPrivate) {
|
||||
std::map<uint64_t, std::string>::const_reverse_iterator reference = data.rbegin();
|
||||
|
||||
reference++;
|
||||
for (; reference != data.rend(); ++reference) {
|
||||
std::pair<uint64_t, std::string> element = cursor->prev();
|
||||
EXPECT_EQ(element.first, reference->first);
|
||||
EXPECT_EQ(element.second, reference->second);
|
||||
}
|
||||
|
||||
EXPECT_THROW(cursor->prev(), LMDBAL::NotFound);
|
||||
|
||||
std::pair<uint64_t, std::string> element = cursor->last();
|
||||
reference = data.rbegin();
|
||||
|
||||
EXPECT_EQ(element.first, reference->first);
|
||||
EXPECT_EQ(element.second, reference->second);
|
||||
}
|
||||
|
||||
TEST_F(StorageCursorTest, Destruction) {
|
||||
cursor->close();
|
||||
|
||||
EXPECT_THROW(cursor->first(), LMDBAL::CursorNotReady);
|
||||
EXPECT_THROW(cursor->last(), LMDBAL::CursorNotReady);
|
||||
EXPECT_THROW(cursor->next(), LMDBAL::CursorNotReady);
|
||||
EXPECT_THROW(cursor->prev(), LMDBAL::CursorNotReady);
|
||||
EXPECT_THROW(cursor->current(), LMDBAL::CursorNotReady);
|
||||
}
|
||||
|
||||
TEST_F(StorageCursorTest, CurrentPrivate) {
|
||||
cursor->open();
|
||||
|
||||
EXPECT_THROW(cursor->current(), LMDBAL::Unknown); //yeah, nice thing to write in the doc
|
||||
|
||||
std::pair<uint64_t, std::string> element = cursor->first();
|
||||
std::map<uint64_t, std::string>::const_iterator reference = data.begin();
|
||||
|
||||
EXPECT_EQ(element.first, reference->first);
|
||||
EXPECT_EQ(element.second, reference->second);
|
||||
|
||||
element = cursor->current();
|
||||
|
||||
EXPECT_EQ(element.first, reference->first);
|
||||
EXPECT_EQ(element.second, reference->second);
|
||||
|
||||
cursor->next();
|
||||
element = cursor->current();
|
||||
++reference;
|
||||
|
||||
EXPECT_EQ(element.first, reference->first);
|
||||
EXPECT_EQ(element.second, reference->second);
|
||||
|
||||
cursor->next();
|
||||
cursor->next();
|
||||
cursor->prev();
|
||||
element = cursor->current();
|
||||
++reference;
|
||||
++reference;
|
||||
--reference;
|
||||
|
||||
EXPECT_EQ(element.first, reference->first);
|
||||
EXPECT_EQ(element.second, reference->second);
|
||||
}
|
Loading…
Add table
Add a link
Reference in a new issue