#include "blobstore/implementations/onblocks/datanodestore/DataInnerNode.h"
#include "blobstore/implementations/onblocks/datanodestore/DataLeafNode.h"
#include "blobstore/implementations/onblocks/datanodestore/DataNode.h"
#include "blobstore/implementations/onblocks/datanodestore/DataNodeStore.h"
#include "blobstore/implementations/onblocks/BlobStoreOnBlocks.h"
#include <gtest/gtest.h>

#include <blockstore/implementations/testfake/FakeBlockStore.h>
#include <blockstore/implementations/testfake/FakeBlock.h>
#include <cpp-utils/pointer/unique_ref_boost_optional_gtest_workaround.h>

using ::testing::Test;
using cpputils::unique_ref;
using cpputils::make_unique_ref;
using std::string;
using boost::none;

using blockstore::BlockStore;
using blockstore::testfake::FakeBlockStore;
using blockstore::BlockId;
using cpputils::Data;
using namespace blobstore;
using namespace blobstore::onblocks;
using namespace blobstore::onblocks::datanodestore;

class DataNodeStoreTest: public Test {
public:
  static constexpr uint32_t BLOCKSIZE_BYTES = 1024;

  unique_ref<BlockStore> _blockStore = make_unique_ref<FakeBlockStore>();
  BlockStore *blockStore = _blockStore.get();
  unique_ref<DataNodeStore> nodeStore = make_unique_ref<DataNodeStore>(std::move(_blockStore), BLOCKSIZE_BYTES);
};

constexpr uint32_t DataNodeStoreTest::BLOCKSIZE_BYTES;

#define EXPECT_IS_PTR_TYPE(Type, ptr) EXPECT_NE(nullptr, dynamic_cast<Type*>(ptr)) << "Given pointer cannot be cast to the given type"

TEST_F(DataNodeStoreTest, CreateLeafNodeCreatesLeafNode) {
  auto node = nodeStore->createNewLeafNode(Data(0));
  EXPECT_IS_PTR_TYPE(DataLeafNode, node.get());
}

TEST_F(DataNodeStoreTest, CreateInnerNodeCreatesInnerNode) {
  auto leaf = nodeStore->createNewLeafNode(Data(0));

  auto node = nodeStore->createNewInnerNode(1, {leaf->blockId()});
  EXPECT_IS_PTR_TYPE(DataInnerNode, node.get());
}

TEST_F(DataNodeStoreTest, LeafNodeIsRecognizedAfterStoreAndLoad) {
  BlockId blockId = nodeStore->createNewLeafNode(Data(0))->blockId();

  auto loaded_node = nodeStore->load(blockId).value();

  EXPECT_IS_PTR_TYPE(DataLeafNode, loaded_node.get());
}

TEST_F(DataNodeStoreTest, InnerNodeWithDepth1IsRecognizedAfterStoreAndLoad) {
  auto leaf = nodeStore->createNewLeafNode(Data(0));
  BlockId blockId = nodeStore->createNewInnerNode(1, {leaf->blockId()})->blockId();

  auto loaded_node = nodeStore->load(blockId).value();

  EXPECT_IS_PTR_TYPE(DataInnerNode, loaded_node.get());
}

TEST_F(DataNodeStoreTest, InnerNodeWithDepth2IsRecognizedAfterStoreAndLoad) {
  auto leaf = nodeStore->createNewLeafNode(Data(0));
  auto inner = nodeStore->createNewInnerNode(1, {leaf->blockId()});
  BlockId blockId = nodeStore->createNewInnerNode(2, {inner->blockId()})->blockId();

  auto loaded_node = nodeStore->load(blockId).value();

  EXPECT_IS_PTR_TYPE(DataInnerNode, loaded_node.get());
}

TEST_F(DataNodeStoreTest, DataNodeCrashesOnLoadIfDepthIsTooHigh) {
  auto block = blockStore->create(Data(BLOCKSIZE_BYTES));
  BlockId blockId = block->blockId();
  {
    DataNodeView view(std::move(block));
    view.setDepth(DataNodeStore::MAX_DEPTH + 1);
  }

  EXPECT_ANY_THROW(
    nodeStore->load(blockId)
  );
}

TEST_F(DataNodeStoreTest, CreatedInnerNodeIsInitialized) {
  auto leaf = nodeStore->createNewLeafNode(Data(0));
  auto node = nodeStore->createNewInnerNode(1, {leaf->blockId()});
  EXPECT_EQ(1u, node->numChildren());
  EXPECT_EQ(leaf->blockId(), node->readChild(0).blockId());
}

TEST_F(DataNodeStoreTest, CreatedLeafNodeIsInitialized) {
  auto leaf = nodeStore->createNewLeafNode(Data(0));
  EXPECT_EQ(0u, leaf->numBytes());
}

TEST_F(DataNodeStoreTest, NodeIsNotLoadableAfterDeleting) {
  auto nodekey = nodeStore->createNewLeafNode(Data(0))->blockId();
  auto node = nodeStore->load(nodekey);
  EXPECT_NE(none, node);
  nodeStore->remove(std::move(*node));
  EXPECT_EQ(none, nodeStore->load(nodekey));
}

TEST_F(DataNodeStoreTest, NumNodesIsCorrectOnEmptyNodestore) {
  EXPECT_EQ(0u, nodeStore->numNodes());
}

TEST_F(DataNodeStoreTest, NumNodesIsCorrectAfterAddingOneLeafNode) {
  nodeStore->createNewLeafNode(Data(0));
  EXPECT_EQ(1u, nodeStore->numNodes());
}

TEST_F(DataNodeStoreTest, NumNodesIsCorrectAfterRemovingTheLastNode) {
  auto leaf = nodeStore->createNewLeafNode(Data(0));
  nodeStore->remove(std::move(leaf));
  EXPECT_EQ(0u, nodeStore->numNodes());
}

TEST_F(DataNodeStoreTest, NumNodesIsCorrectAfterAddingTwoNodes) {
  auto leaf = nodeStore->createNewLeafNode(Data(0));
  auto node = nodeStore->createNewInnerNode(1, {leaf->blockId()});
  EXPECT_EQ(2u, nodeStore->numNodes());
}

TEST_F(DataNodeStoreTest, NumNodesIsCorrectAfterRemovingANode) {
  auto leaf = nodeStore->createNewLeafNode(Data(0));
  auto node = nodeStore->createNewInnerNode(1, {leaf->blockId()});
  nodeStore->remove(std::move(node));
  EXPECT_EQ(1u, nodeStore->numNodes());
}

TEST_F(DataNodeStoreTest, PhysicalBlockSize_Leaf) {
  auto leaf = nodeStore->createNewLeafNode(Data(0));
  auto block = blockStore->load(leaf->blockId()).value();
  EXPECT_EQ(BLOCKSIZE_BYTES, block->size());
}

TEST_F(DataNodeStoreTest, PhysicalBlockSize_Inner) {
  auto leaf = nodeStore->createNewLeafNode(Data(0));
  auto node = nodeStore->createNewInnerNode(1, {leaf->blockId()});
  auto block = blockStore->load(node->blockId()).value();
  EXPECT_EQ(BLOCKSIZE_BYTES, block->size());
}